Flexibility in Algebraic Nets

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.

[1]  Gérard Roucairol,et al.  Linear Algebra in Net Theory , 1979, Advanced Course: Net Theory and Applications.

[2]  Wilfried Brauer,et al.  Net Theory and Applications , 1980, Lecture Notes in Computer Science.

[3]  Peter Radford,et al.  Petri Net Theory and the Modeling of Systems , 1982 .

[4]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Specification 1: Equations and Initial Semantics , 1985 .

[5]  Jacques Vautherin,et al.  Parallel systems specitications with coloured Petri nets and algebraic specifications , 1986, European Workshop on Applications and Theory of Petri Nets.

[6]  Kurt Jensen,et al.  Coloured Petri Nets: Modelling and Validation of Concurrent Systems , 2009 .

[7]  Wolfgang Reisig,et al.  The Semantics of a Net is a Net , 1987 .

[8]  Eike Best,et al.  Nonsequential Processes , 1988, EATCS Monographs on Theoretical Computer Science.

[9]  Jonathan Billington.  Extending coloured petri nets , 1988 .

[10]  M. Broy.  On the Design and Verification of a Simple Distributed Spanning Tree Algorithm , 1990 .

[11]  Wolfgang Reisig,et al.  Petri Nets and Algebraic Specifications , 1991, Theor. Comput. Sci..

[12]  Jonathan Billington,et al.  Extensions to coloured Petri nets and their application to protocols , 1991 .

[13]  Kurt Jensen.  Informal Introduction to Coloured Petri Nets , 1992 .

[14]  Rüdiger Valk.  Bridging the Gap Between Place- and Floyd-Invariants with Applications to Preemptive Scheduling , 1993, Application and Theory of Petri Nets.

[15]  Gerhard Goos,et al.  Computer Science Today: Recent Trends and Developments , 1995 .

[16]  Wolfgang Reisig,et al.  Petri Net Models of Distributed Algorithms , 1995, Computer Science Today.

[17]  Wolfgang Reisig,et al.  Algebraic System Nets for ModellingDistributed Algorithms , 1996 .

[18]  Jörg Desel,et al.  Proving Nonreachability by Modulo-Invariants , 1996, Theor. Comput. Sci..

[19]  Wolfgang Reisig,et al.  Verification of Distributed Algorithms with Algebraic Petri Nets , 1997, Foundations of Computer Science: Potential - Theory - Cognition.

[20]  Karsten Wolf.  Verification of Siphons and Traps for Algebraic Petri Nets , 1997, ICATPN.

[21]  Wilfried Brauer,et al.  Foundations of computer science : potential--theory--cognition , 1997 .

[22]  Karsten Schmidt.  Verification of Siphons and Traps for Algebraic Petri Nets , 1997 .

[23]  Hagen Völzer.  Verifying Fault Tolerance of Distributed Algorithms Formally - An Example , 1998, ACSD.