Efficient unfolding of contextual Petri nets
DOI10.1016/J.TCS.2012.04.046zbMATH Open1263.68117OpenAlexW1975899067MaRDI QIDQ443729FDOQ443729
Authors: Paolo Baldan, Alessandro Bruni, Andrea Corradini, Barbara König, César Rodríguez, Stefan Schwoon 
Publication date: 13 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.04.046
Recommendations
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Mole
- Unfoldings: A partial-order approach to model checking.
- An improvement of McMillan's unfolding algorithm
- Canonical prefixes of Petri net unfoldings
- Semantics of inhibitor nets
- Efficient Contextual Unfolding
- Title not available (Why is that?)
- McMillan’s Complete Prefix for Contextual Nets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the computation of McMillan's prefix for contextual nets and graph grammars
- Contextual occurrence nets and concurrent constraint programming
Cited In (18)
- McMillan’s Complete Prefix for Contextual Nets
- Star-Topology Decoupling in SPIN
- A calculus of concurrent graph-rewriting processes
- Concurrency in Boolean networks
- Goal-driven unfolding of Petri nets
- Construction and SAT-based verification of contextual unfoldings
- Star-topology decoupled state space search
- Cunf: a tool for unfolding and verifying Petri nets with read arcs
- Non-atomic transition firing in contextual nets
- Methods for Efficient Unfolding of Colored Petri Nets
- Branching processes of timed Petri nets
- On the computation of McMillan's prefix for contextual nets and graph grammars
- Contextual Petri nets, asymmetric event structures, and processes
- Verification of Petri nets with read arcs
- Contextual merged processes
- ``Truly concurrent and nondeterministic semantics of discrete-time Petri nets
- Contextual nets
- Efficient Contextual Unfolding
Uses Software
This page was built for publication: Efficient unfolding of contextual Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q443729)
