• Citer

Recursive nets in the box algebra

par Devillers, Raymond ;Koutny, Maciej
Référence Proceedings (International Conference on Application of Concurrency to System Design), 1998-March, page (239-249), 657555
Publication Publié, 1998

Article révisé par les pairs

• Détails
• Contenu

Résumé :

This paper presents an approach to giving a formal meaning to Petri nets defined using recursive equa- tions. It specifically addresses this problem for the box algebra, a model of concurrent computation which combines Petri nets and standard process algebras. The paper presents a detailed investigation of the solv- ability of recursive equations on nets in a setting which allows an infinite number of possibly unguarded equa- tions, each equation possibly involving infinitely many recursion variables. The main result is that by using a suitable partially ordered domain of nets, it is always possible to solve a system of equations by construct- ing the limit of a chain of successive approximations starting from a suitable, very simple, net.