In: Rozenberg, G.: Lecture Notes in Computer Science, Vol. 424; Advances in Petri Nets 1989, pages 77-104. Berlin, Germany: Springer-Verlag, 1990.
Abstract: An analytical algebra AFP1 of finite nondeterministic concurrent processes is introduced. The semantics of processes specified by a formula of AFP1 is characterized by a set of partial orders with ``non-actions''. The notion of process equivalence is introduced and its complete axiomatization is proposed. The ``descriptive'' algebra AFP0 for specifying structure of finite (acyclic) Petri nets is presented. The interrelation between AFP0 and AFP1 is investigated.
Keywords: process algebra; process equivalence; semantics.
Back to the Petri Nets Bibliography