Fifo nets without order deadlock
Acta Informatica
Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
OBJSA nets: a class of high-level nets having objects as domains
Advances in Petri Nets 1988
Nonsequential processes
Equivalence transformations of PrT-nets
Advances in Petri nets 1989
Information and Computation
Petri nets as models of linear logic
CAAP '90 Proceedings of the fifteenth colloquium on CAAP'90
Petri nets and algebraic specifications
Theoretical Computer Science
Real-Time Systems
Some fundamental algebraic tools for the semantics of computation, part 3: indexed categories
Theoretical Computer Science
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
A logical theory of concurrent objects and its realization in the Maude language
Research directions in concurrent object-oriented programming
Algebraic high level nets: Petri nets revisited
Selected papers from 9th workshop on Specification of abstract data types : recent trends in data type specification: recent trends in data type specification
Theoretical Computer Science - Special volume on Petri nets
Process versus unfolding semantics for place/transition Petri nets
Theoretical Computer Science - Special volume on Petri nets
Elements of distributed algorithms: modeling and analysis with Petri nets
Elements of distributed algorithms: modeling and analysis with Petri nets
A linear logic view of object petri nets
Fundamenta Informaticae - Special issue on Petri nets
Specification and proof in membership equational logic
Theoretical Computer Science - Trees in algebra and programming
Specification of real-time and hybrid systems in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Partial Order Semantics and Read Arcs
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
A Uniform Approach to Petri Nets
Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday
A Comparison of Petri Net Semantics under the Collective Token Philosophy
ASIAN '98 Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science
Representation Theorems for Petri Nets
Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday
Algebraic Models for Contextual Nets
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Rewriting: An Effective Model of Concurrency
PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe
A Partial Order Event Model for Concurrent Objects
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
On the Semantics of Petri Nets
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
The Analysis of Distributed Systems by Means of Predicate ? Transition-Nets
Proceedings of the International Sympoisum on Semantics of Concurrent Computation
Fifo nets: a new model of parallel computation
Proceedings of the 6th GI-Conference on Theoretical Computer Science
From Coloured Petri Nets to Object Petri Nets
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
Petri Nets as Token Objects: An Introduction to Elementary Object Nets
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
A fifo-net model for processes with asynchronous communication
Advances in Petri Nets 1992, The DEMON Project
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
Semantics, composition and net properties of algebraic high-level nets
Papers from the 11th International Conference on Applications and Theory of Petri Net: Advances in Petri Nets 1991
Coloured Petri Nets Extended with Place Capacities, Test Arcs and Inhibitor Arcs
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Analysis of Place/Transition Nets with Timed Arcs and its Application to Batch Process Control
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Interval Timed Coloured Petri Nets and their Analysis
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
On the Model of Computation of Place/Transition Petri Nets
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Relating Different Semantics for Object Petri Nets
Relating Different Semantics for Object Petri Nets
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Specification of real-time and hybrid systems in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Revisiting the algebra of Petri net processes under the collective token philosophy
Fundamenta Informaticae - Concurrency specification and programming
Concurrency in mobile object net systems
Fundamenta Informaticae - Concurrency specification and programming
Semantic foundations for generalized rewrite theories
Theoretical Computer Science
Higher-Order and Symbolic Computation
Coding Mobile Synchronizing Petri Nets into Rewriting Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Expander2: Program Verification Between Interaction and Automation
Electronic Notes in Theoretical Computer Science (ENTCS)
Semantics of petri nets: a comparison
Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come
A Basic Logic for Reasoning about Connector Reconfiguration
Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
Causal Semantics of Algebraic Petri Nets distinguishing Concurrency and Synchronicity
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'06)
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Component-based security policy design with colored Petri nets
Semantics and algebraic specification
Multiset rewriting: a semantic framework for concurrency with name binding
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Probabilistic real-time rewrite theories and their expressive power
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Specification and analysis of distributed object-based stochastic hybrid systems
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Formal Methods in Software and Systems Modeling
Reference and value semantics are equivalent for ordinary object petri nets
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Multiset rewriting for the verification of depth-bounded processes with name binding
Information and Computation
A Basic Logic for Reasoning about Connector Reconfiguration
Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
Causal Semantics of Algebraic Petri Nets distinguishing Concurrency and Synchronicity
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'06)
Revisiting the Algebra of Petri Net Processes under the Collective Token Philosophy
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
Concurrency in Mobile Object Net Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
Hi-index | 0.00 |
We propose rewriting logic as a unifying framework for a wide range of Petri nets models. We treat in detail place/transition nets and important extensions of the basic model by individual tokens, test arcs, and time. Based on the idea that "Petri nets are monoids" suggested by Meseguer and Montanari we define a rewriting semantics that maps place/transition nets into rewriting logic specifications. We furthermore generalize this result to a general form of algebraic net specifications subsuming also colored Petri nets as a special case. The soundness and completeness results we state relate the commutative process semantics of Petri nets proposed by Best and Devillers to the model-theoretic semantics of rewriting logic in the sense of natural isomorphisms between suitable functors. In addition we show how place/transition nets with test arcs and timed Petri nets can be equipped with a rewriting semantics and discuss how other extensions can be treated along similar lines. Beyond the conceptual unification of quite different kinds of Petri nets within a single framework, the rewriting semantics can provide a guide for future extensions of Petri nets and help to cope with the growing diversity of models in this field. On the practical side, a major application of the rewriting semantics is its use as a logical and operational representation of Petri net models for formal verification and for the efficient execution and analysis using a rewriting engine such as Maude, which also allows us to specify different execution and analysis strategies in the same rewriting logic language by means of reflection.