Petri nets: an introduction
Petr nets, algebras, morphisms, and compositionality
Information and Computation
Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
Information and Computation
A uniform approach to true-concurrency and interleaving semantics for Petri nets
Theoretical Computer Science
Operational and denotational semantics for the box algebra
Theoretical Computer Science
Fundamentals of Algebraic Specification I
Fundamentals of Algebraic Specification I
The Category of Typed Graph Grammars and its Adjunctions with Categories
Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
Operational Semantics for the Petri Box Calculus
CONCUR '94 Proceedings of the Concurrency Theory
Characterizing Behavioural Congruences for Petri Nets
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Concurrent Graph and Term Graph Rewriting
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
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
Open Petri Nets: Non-deterministic Processes and Compositionality
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Abstract Semantics by Observable Contexts
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
On the Use of Behavioural Equivalences for Web Services' Development
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
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
Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
Theoretical Computer Science
Encoding Asynchronous Interactions Using Open Petri Nets
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Maintaining consistency in layered architectures of mobile ad-hoc networks
FASE'07 Proceedings of the 10th international conference on Fundamental approaches to software engineering
Bisimilarity and behaviour-preserving reconfigurations of open Petri nets
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
A behavioural congruence for web services
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Modeling dynamic reconfigurations in Reo using high-level replacement systems
Science of Computer Programming
Representations of Petri net interactions
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Concurrency can't be observed, asynchronously
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
A connector algebra for P/T nets interactions
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Modular modelling of software product lines with feature nets
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
Symbolic semantics for the verification of security properties of mobile petri nets
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Connector algebras, petri nets, and BIP
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
On the Use of Behavioural Equivalences for Web Services' Development
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
Coalgebraic models for reactive systems
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Hi-index | 0.00 |
In order to model the behaviour of open concurrent systems by means of Petri nets, we introduce open Petri nets, a generalisation of the ordinary model where some places, designated as open, represent an interface between the system and the environment. Besides generalising the token game to reflect this extension, we define a truly concurrent semantics for open nets by extending the Goltz–Reisig process semantics of Petri nets. We introduce a composition operation over open nets, characterised as a pushout in the corresponding category, suitable for modelling both interaction through open places and synchronisation of transitions. The deterministic process semantics is shown to be compositional with respect to such a composition operation. If a net $Z_3$ results as the composition of two nets $Z_1$ and $Z_2$, having a common subnet $Z_0$, then any two deterministic processes of $Z_1$ and $Z_2$ that ‘agree’ on the common part, can be ‘amalgamated’ to produce a deterministic process of $Z_3$. Conversely, any deterministic process of $Z_3$ can be decomposed into processes of the component nets. The amalgamation and decomposition operations are shown to be inverse to each other, leading to a bijective correspondence between the deterministic processes of $Z_3$ and the pair of deterministic processes of $Z_1$ and $Z_2$ that agree on the common subnet $Z_0$. Technically, our result is similar to the amalgamation theorem for data-types in the framework of algebraic specification. A possible application field of the proposed constructions and results is the modelling of interorganisational workflows, recently studied in the literature. This is illustrated by a running example.