Languages and machines : an introduction to the theory of computer science
Languages and machines : an introduction to the theory of computer science
A calculus of mobile processes, I
Information and Computation
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Proceedings on Mathematical Foundations of Computer Science
Self-Modifying Nets, a Natural Extension of Petri Nets
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Reset Nets Between Decidability and Undecidability
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Tutorial introduction to the algebraic approach of graph grammars
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
Net-Based Description Of Parallel Object-Based Systems, or POTs and POPs
Proceedings of the REX School/Workshop on Foundations of Object-Oriented Languages
Mobile Petri Nets
Transformations in Reconfigurable Place/Transition Systems
Concurrency, Graphs and Models
Independence of net transformations and token firing in reconfigurable place/transition systems
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Translating model simulators to analysis models
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
Design and reduction of UML-PN models of power plant's fault management system
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 2
| Hi-index | 14.98 |
The aim of this work is the modeling and verification of concurrent systems subject to dynamic changes using extensions of Petri nets. We begin by introducing the notion of net rewriting system. In a net rewriting system, a system configuration is described as a Petri net and a change in configuration is described as a graph rewriting rule. We show that net rewriting systems are Turing powerful, that is, the basic decidable properties of Petri nets are lost and, thus, automatic verification in not possible for this class. A subclass of net rewriting systems are reconfigurable Petri nets. In a reconfigurable Petri net, a change in configuration amounts to the modification of the flow relations of the places in the domain of the involved rule according to this rule, independently of the context in which this rewriting applies. We show that reconfigurable Petri nets are formally equivalent to Petri nets. This equivalence ensures that all the fundamental properties of Petri nets are still decidable for reconfigurable Petri nets and this model is thus amenable to automatic verification tools. Therefore, the expressiveness of both models is the same, but, with reconfigurable Petri nets, we can easily and directly model systems that change their structure dynamically.