For the most recent entries see the Petri Nets Newsletter.

The Box Algebra - A Model of Nets and Process Expressions.

Best, Eike; Devillers, Raymond; Koutny, Maciej

In: Donatelli, Susanna; Kleijn, Jetty: Lecture Notes in Computer Science, Vol. 1630: Application and Theory of Petri Nets 1999, 20th International Conference, ICATPN'99, Williamsburg, Virginia, USA, pages 344-363. Springer-Verlag, June 1999.

Abstract: The paper outlines a Petri net as well as a structural op- erational semantics for an Algebra of process expressions. lt specifically addresses this problem for the box Algebra, a model of concurrent computation which combines Petri nets and standard process algebras. The paper proceeds in arguably the most general setting. For it allows infinite operators, and recursive definitions which can be unguarded and involve infinitely many recursion variables. The main result is that it is possible to obtain a framework where process expressions can be given two, entirely consistent, kinds of semantics, one based on Petri nets, the other on SOS rules.

Keywords: Net-based algebraic calculi; relationships between net theory and other approaches; process algebras; box algebra; refinement; recursion; SOS semantics..

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography