In: Kreczmar, A.; et al.: Lecture Notes in Computer Science, Vol. 379; Mathematical Foundations of Conputer Science 1989, pages 67-87. Springer-Verlag, 1989.
Abstract: The theory of Petri nets establishes a model of concurrency without a calculus for verification of statements about processes. The algebra of finite processes AFPi proposed in this paper is intended to combine the mechanism for the description of nondeterministic concurrent processes and the derivation of their behavioural properties. In AFPi, specifying the structural relation between process elements (ie a process structure), the author defines a process with the same behavioural properties.
Keywords: nondeterministic process; algebra (of) finite processes.
Back to the Petri Nets Bibliography