The semantics of a net is a net—an exercise in general net theory
Concurrency and nets: advances in Petri nets
Nonsequential processes
Petri nets and algebraic specifications
Theoretical Computer Science
Proving nonreachability by modulo-invariants
Theoretical Computer Science - Special volume on Petri nets
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Fundamentals of Algebraic Specification I
Fundamentals of Algebraic Specification I
Verification of Distributed Algorithms with Algebraic Petri Nets
Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday
Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
Verification of Siphons and Traps for Algebraic Petri Nets
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
Parallel systems specitications with coloured Petri nets and algebraic specifications
Advances in Petri Nets 1987, covers the 7th European Workshop on Applications and Theory of Petri Nets
Bridging the Gap Between Place- and Floyd-Invariants with Applications to Preemptive Scheduling
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Verifying Fault Tolerance of Distributed Algorithms Formally - An Example
CSD '98 Proceedings of the 1998 International Conference on Application of Concurrency to System Design
Abstract Petri Nets as a Uniform Approach to High/Level Petri Nets
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
Verifying Intuition - ILF Checks DAWN Proofs
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Optimising Enabling Tests and Unfoldings of Algebraic System Nets
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Model Checking LTL Properties of High-Level Petri Nets with Fairness Constraints
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Maria: Modular Reachability Analyser for Algebraic System Nets
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Petri Nets, Situations, and Automata
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Rewriting Logic as a Unifying Framework for Petri Nets
Unifying Petri Nets, Advances in Petri Nets
A Multi-region Linear Logic Based Calculus for Dynamic Petri Net Structures
Fundamenta Informaticae
ILF and DAWN for Verifying Distributed Algorithms - An Idea for a Tool
Fundamenta Informaticae
Finding Symmetries of Algebraic System Nets
Fundamenta Informaticae
Hi-index | 0.00 |
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.