Branching processes of Petri nets
Acta Informatica
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
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
Contextual Petri nets, asymmetric event structures, and processes
Information and Computation
The box algebra = Petri nets + process expressions
Information and Computation
Categories of Models for Concurrency
Seminar on Concurrency, Carnegie-Mellon University
Characterizing Behavioural Congruences for Petri Nets
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
A Class of Composable High Level Petri Nets with an Application to the Semantics of B(PN)2
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
A Compositional Partial Order Semantics for Petri Net Components
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Formal and natural computing
Compositional Semantics of Open Petri Nets based on Deterministic Processes
Compositional Semantics of Open Petri Nets based on Deterministic Processes
On the semantics of place/transition Petri nets
Mathematical Structures in Computer Science
Operational semantics for Petri net components
Theoretical Computer Science
Unfolding-Based Diagnosis of Systems with an Evolving Topology
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Open Petri Nets: Non-deterministic Processes and Compositionality
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Composition and Independence of High-Level Net Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Branching processes of high-level Petri nets
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
On the construction of pullbacks for safe petri nets
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Building Occurrence Nets from Reveals Relations
Fundamenta Informaticae
| Hi-index | 0.00 |
The unfolding technique is an efficient tool to explore the runs of a Petri net in a true concurrency semantics, i.e. without constructing all the interleavings of concurrent actions. But even small real systems are never modeled directly as ordinary Petri nets: they use many high-level features that were designed as extensions of Petri nets. We focus here on two such features: colors and compositionality. We show that the symbolic unfolding of a product of colored Petri nets can be expressed as the product of the symbolic unfoldings of these nets. This is a necessary result in view of distributed computations based on symbolic unfoldings, as they have been developed already for standard unfoldings, to design modular verification techniques, or modular diagnosis procedures, for example. The factorization property of symbolic unfoldings is valid for several classes of colored or high-level nets. We derive it here for a class of (high-level) open nets, for which the composition is performed by connecting places rather than transitions.