Abstract
Algebraic Petri nets as defined by Reisig [17] lack a feature for modelling distributed network algorithms, viz. flexible arcs. In this paper we equip algebraic Petri nets with flexible arcs and we call the resulting extension algebraic system nets. We demonstrate that algebraic system nets are better suited for modelling distributed algorithms.
Besides this practical motivation for introducing algebraic system nets there is a theoretical one. The concept of place invariants introduced along with algebraic Petri nets has a slight insufficiency: There may be place invariants of an unfolded algebraic Petri net which cannot be expressed as a place invariant of the algebraic Petri net itself. By introducing algebraic system nets along with a slightly more general concept of place invariants we also eliminate this insufficiency.
Moreover, we generalize the concept of place invariants which we call simulations. Many well-known concepts of Petri net theory such as siphons, traps, modulo-invariants, sur-invariants and sub-invariants are special cases of a simulation. Still, a simulation can be verified in the same style as classical place invariants of algebraic Petri nets.
Supported by the DFG: Konsensalgorithmen
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 C. Fernández. Nonsequential Processes. Springer, 1988.
J. Billington. Extending coloured Petri nets. Technical Report 148, University of Cambridge, Computer Laboratory, Oct. 1988.
J. Billington. Extensions to Coloured Petri Nets and their Application to Protocols. Technical Report 222, University of Cambridge, May 1991.
M. Broy. On the design and verification of a simple distributed spanning tree algorithm. SFB-Bericht 342/24/90 A, Technische Universtität München, Dec. 1990.
J. Desel, K.-P. Neuendorf, and M.-D. Radola. Proving nonreachability by moduloinvariants. Theoretical Computer Science, 153:49–64, 1996.
H. Ehrig and B. Mahr. Fundamentals of Algebraic Specifications 1, Equations and Initial Semantics, Springer, 1985.
U. Goltz and W. Reisig. The non-sequential behaviour of Petri nets. Information and Control, 57:125–147, 1983.
K. Jensen. Coloured Petri Nets, Volume 1: Basic Concepts. Springer, 1992.
K. Jensen. Coloured Petri Nets. Volume 2: Analysis Methods. Springer, 1995.
E. Kindler and W. Reisig. Algebraic system nets for modelling distributed algorithms. Petri Net Newsletter, 51:16–31, Dec. 1996.
E. Kindler and W. Reisig. Verification of distributed algorithms with algebraic Petri nets. In C. Freksa, M. Jantzen, and R. Valk, editors, Foundations of Computer Science: Potential — Theory — Cognition, LNCS 1337, pp. 261–270. Springer 1997.
E. Kindler, W. Reisig, H. Völzer, and R. Walter. Petri net based verification of distributed algorithms: An example. Formal Aspects of Computing, 9:409–424, 1997.
E. Kindler and H. Völzer. Flexibility in algebraic nets. Informatik-Bericht 89, Humboldt-Universität zu Berlin, Institut für Informatik, 1997. Available at http://www.informatik.hu-berlin.de/~kindler/papers.html
G. Memmi and G. Roucairol. Linear algebra in net theory. In W. Brauer, editor, Net Theory and Applications, LNCS 84, pp. 213–223. Springer, Oct. 1979.
J. L. Peterson. Petri Net Theory And The Modeling of Systems. Prentice-Hall 1981.
W. Reisig. Petri Nets, Springer, 1985.
W. Reisig. Petri nets and algebraic specifications. Theoretical Computer Science, 80:1–34, May 1991.
W. Reisig. Petri net models of distributed algorithms. In J. van Leeuwen, editor, Computer Science Today: Recent Trends and Developments, LNCS 1000, pp. 441–454. Springer, 1995.
K. Schmidt. Verification of siphons and traps for algebraic Petri nets. In P. Azéma and G. Balbo, editors, Application and Theory of Petri Nets 1997, International Conference, Proceedings, LNCS 1248, pp. 427–446. Springer, June 1997.
E. Smith and W. Reisig. The semantics of a net is a net, an exercise in general net theory. In K. Voss, H. Genrich, and G. Rozenberg, editors, Concurrency and Nets. Springer, 1987.
R. Valk. Bridging the gap between place-and Floyd-invariants with applications to preemptive scheduling. In M. A. Marsan (ed), Application and Theory of Petri Nets 1993, International Conference, Proceedings, LNCS 691, pp. 431–452. Springer, June 1993.
J. Vautherin. Parallel systems specifications with coloured Petri nets and algebraic specifications. In G. Rozenberg, editor, Advances in Petri Nets, LNCS 266, pp. 293–308. Springer, 1987.
H. Völzer. Verifying fault tolerance of distributed algorithms formally: An example. In CSD98, ‘International Conference on Application of Concurrency to System Design’, Aizu-Wakamatsu City, Japan, Mar. 1998. IEEE Computer Society Press.
M. Weber, R. Walter, H. Völzer, T. Vesper, W. Reisig, S. Peuker, E. Kindler, J. Freiheit, and J. Desel. DAWN: Petrinetzmodelle zur Verifikation Verteilter Algorithmen. Informatik-Bericht 88, Humboldt-Universität zu Berlin, Dec. 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kindler, E., Völzer, H. (1998). Flexibility in Algebraic Nets. In: Desel, J., Silva, M. (eds) Application and Theory of Petri Nets 1998. ICATPN 1998. Lecture Notes in Computer Science, vol 1420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69108-1_19
Download citation
DOI: https://doi.org/10.1007/3-540-69108-1_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64677-8
Online ISBN: 978-3-540-69108-2
eBook Packages: Springer Book Archive