Abstract
“Petri nets are monoids” is the title and the central idea of the paper [7]. It provides an algebraic approach to define both nets and their processes as terms. A crucial assumption for this concept is that arbitrary concurrent composition of processes is defined, which holds true for place/transition Petri nets where places can hold arbitrarily many tokens.
A decade earlier, [10] presented a similar concept for elementary Petri nets, i.e. nets where no place can ever carry more than one token. Since markings of elementary Petri nets cannot be added arbitrarily, concurrent composition is defined as a partial operation.
The present papers provides a general approach to process term semantics. Terms are equipped with the minimal necessary information to determine if two process terms can be composed concurrently. Applying the approach to elementary nets yields a concept very similar to the one in [10].
The second result of this paper states that the semantics based on process terms agrees with the classical partial-order process semantics for elementary net systems. More precisely, we provide a syntactic equivalence notion for process terms and a bijection from according equivalence classes of process terms to isomorphism classes of partially ordered processes. This result slightly generalizes a similar observation given in [11].
supported by DFG: Project “SPECIMEN”
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Best and R. Devillers. Sequential and Concurrent Behaviour in Petri Net Theory. Theoretical Computer Science, 55, pp. 87–136, 1987.
P. Burmeister. Lecture Notes on Universal Algebra-Many Sorted Partial Algebras. Technical Report, TU Darmstadt, 1998.
E. Degano, J. Meseguer and U. Montanari. Axiomatizing the Algebra of Net Computations and Processes. Acta Informatica, 33(7), pp. 641–667, 1996.
R. Janicki and M. Koutny. Semantics of Inhibitor Nets. Information and Computations, 123, pp. 1–16, 1995.
G. Juhás. Reasoning about algebraic generalisation of Petri nets. In S. Donatelli and J. Klein (Eds.) Proc. of 20th International Conference on Application and Theory of Petri Nets, Springer, LNCS 1639, pp. 324–343, 1999.
G. Juhás. On semantics of Petri nets over partial algebra. In J. Pavelka, G. Tel and M. Bartosek (Eds.) Proc. of 26th Seminar on Current Trends in Theory and Practice of Informatics SOFSEM’99, Springer, LNCS 1725, pp. 408–415, 1999.
J. Meseguer and U. Montanari. Petri Nets are Monoids. Information and Computation, 88(2):105–155, October 1990.
U. Montanari and F. Rossi. Contextual Nets. Acta Informatica, 32(6), pp. 545–596, 1995.
G. Rozenberg and J. Engelfriet. Elementary Net Systems. In W. Reisig and G. Rozenberg (Eds.) Lectures on Petri Nets I: Basic Models, Springer, LNCS 1491, pp. 12–121, 1998.
J. Winkowski. Behaviours of Concurrent Systems. Theoretical Computer Science, 12, pp. 39–60, 1980.
J. Winkowski. An Algebraic Description of System Behaviours. Theoretical Computer Science, 21, pp. 315–340, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Desel, J., Juhás, G., Lorenz, R. (2000). Process Semantics of Petri Nets over Partial Algebra. In: Nielsen, M., Simpson, D. (eds) Application and Theory of Petri Nets 2000. ICATPN 2000. Lecture Notes in Computer Science, vol 1825. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44988-4_10
Download citation
DOI: https://doi.org/10.1007/3-540-44988-4_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67693-5
Online ISBN: 978-3-540-44988-1
eBook Packages: Springer Book Archive