Petri nets: an introduction
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Executions: a new partial-order semantics of Petri nets
Theoretical Computer Science
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Characterizing Behavioural Congruences for Petri Nets
CONCUR '95 Proceedings of the 6th 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
A Compositional Partial Order Semantics for Petri Net Components
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
The box calculus: a new causal algebra with multi-label communication
Advances in Petri Nets 1992, The DEMON Project
Compositional semantics for open Petri nets based on deterministic processes
Mathematical Structures in Computer Science
A behavioural congruence for web services
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Transformations in Reconfigurable Place/Transition Systems
Concurrency, Graphs and Models
Parallel and Sequential Independence for Borrowed Contexts
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Open Petri Nets: Non-deterministic Processes and Compositionality
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Minimization Algorithm for Symbolic Bisimilarity
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Coalgebraic symbolic semantics
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Hi-index | 0.00 |
We propose a framework for the specification of behaviourpreserving reconfigurations of systems modelled as Petri nets. The framework is based on open nets, a mild generalisation of ordinary Place/ Transition nets suited to model open systems which might interact with the surrounding environment and endowed with a colimit-based composition operation. We show that natural notions of (strong and weak) bisimilarity over open nets are congruences with respect to the composition operation. We also provide an up-to technique for facilitating bisimilarity proofs. The theory is used to identify suitable classes of reconfiguration rules (in the double-pushout approach to rewriting) whose application preserves the observational semantics of the net.