Abstract
Partial algebra is a suitable tool to define sequential semantics for arbitrary restrictions of the occurrence rule, such as capacity or context restrictions. This paper focuses on non-sequential process semantics of Petri nets over partial algebras. It is shown that the concept of partial algebra is suitable as a basis for process construction of different classes of Petri nets taking dependencies between processes that restrict concurrent composition into consideration.
Thus, Petri nets over partial algebra provide a unifying framework for Petri net classes in which some processes cannot be executed concurrently, such as elementary nets with context. We will illustrate this claim proving a one-to-one correspondence between processes constructed using partial algebra and processes based on partial orders for elementary nets with context. Furthermore, we provide compositional process term semantics using the presented framework for place/transition nets with (both weak and strong) capacities and place/transition nets with inhibitor arcs.
supported by DFG: Project “SPECIMEN”
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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.
R. Bruni, J. Meseguer, U. Montanari and V. Sassone A Comparison of Petri Net Semantics under the Collective Token Philosophy. Proc. of ASIAN 1998, Springer, LNCS 1538, pp. 225–244, 1998.
R. Bruni and V. Sassone Algebraic Models for Contextual Nets. Proc. of ICALP 2000, Springer, LNCS 1853, pp. 175–186, 2000.
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.
J. Desel, G. Juhás and R. Lorenz. Process Semantics of Petri Nets over Partial Algebra. In M. Nielsen and D. Simpson (Eds.) Proc. of 21th International Conference on Application and Theory of Petri Nets, Springer, LNCS 1825, pp. 146–165, 2000.
J. Desel, G. Juhás and R. Lorenz. Petri Nets over Partial Algebra. To appear in H. Ehrig, G. Juhás, J. Padberg and G. Rozenberg (Eds.) Unifying Petri Net, Advances in Petri Nets, Springer, LNCS, 2001.
J. Desel and G. Juhás. What is a Petri Net? To appear in H. Ehrig, G. Juhás, J. Padberg and G. Rozenberg (Eds.) Unifying Petri Net, Advances in Petri Nets, Springer, LNCS, 2001.
J. Desel and W. Reisig. Place/Transition Petri Nets. In Lectures on Petri nets I: Basic Models, LNCS 1491, pp. 123–174, 1998.
R. Devillers. The Semantics of Capacities in P/T Nets. In Advances in Petri Nets 1989, LNCS 424, pp. 128–150, 1990.
F. Gadducci and U. Montanari. Axioms for Contextual Net Processes. In Proc of. ICALP’98, Springer, LNCS 1443, pp. 296–308, 1998.
H-M. Hanisch and A. Lüder A Signal Extension for Petri nets and its Use in Controller Design. To appear in Fundamenta informaticae, 2000.
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. 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.
E. Kindler and M. Weber. The Dimensions of Petri Nets: The Petri Net Cube. EATCS Bulletin, No. 66, pp. 155–166, 1998.
H.C.M. Kleijn, M. Koutny. Process Semantics of P/T-Nets with Inhibitor Arcs. In M. Nielsen and D. Simpson (Eds.) Proc. of 21th International Conference on Application and Theory of Petri Nets, Springer, LNCS 1825, pp. 261–281, 2000.
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.
J. Padberg. Abstract Petri Nets: Uniform Approach and Rule-Based Refinement, Ph.D. Thesis, TU Berlin, Germany, 1996.
J. Padberg. Classification of Petri Nets Using Adjoint Functors Bulletin of EACT S No. 66, 1998.
J. Padberg and H. Ehrig. Parametrized Net Classes: A uniform approach to net classes. To appear in H. Ehrig, G. Juhás, J. Padberg and G. Rozenberg (Eds.) Unifying Petri Net, Advances in Petri Nets, Springer, LNCS, 2001.
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.
V. Sassone An Axiomatization of the Category of Petri Net Computations. Mathematical Structures in Computer Science, vol. 8, pp. 117–151, 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
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Desel, J., Juhás, G., Lorenz, R. (2001). Petri Nets over Partial Algebra. In: Ehrig, H., Padberg, J., Juhás, G., Rozenberg, G. (eds) Unifying Petri Nets. Lecture Notes in Computer Science, vol 2128. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45541-8_6
Download citation
DOI: https://doi.org/10.1007/3-540-45541-8_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43067-4
Online ISBN: 978-3-540-45541-7
eBook Packages: Springer Book Archive