Efficient unfolding of contextual Petri nets

DOI10.1016/j.tcs.2012.04.046zbMath1263.68117OpenAlexW1975899067MaRDI QIDQ443729

Alessandro Bruni, César Rodríguez, Barbara König, Paolo Baldan, Stefan Schwoon, Andrea Corradini

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

zbMATH Keywords

contextual Petri netsunfoldings

Mathematics Subject Classification ID

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)

Related Items (9)

Star-Topology Decoupling in SPIN ⋮ Branching Processes of Timed Petri Nets ⋮ Non-atomic Transition Firing in Contextual Nets ⋮ Concurrency in Boolean networks ⋮ ``Truly concurrent and nondeterministic semantics of discrete-time Petri nets ⋮ Star-topology decoupled state space search ⋮ A calculus of concurrent graph-rewriting processes ⋮ Unnamed Item ⋮ Efficient Contextual Unfolding

Uses Software

• Punf
• Cunf
• Mole

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mole
• An improvement of McMillan's unfolding algorithm
• Canonical prefixes of Petri net unfoldings
• Unfoldings: A partial-order approach to model checking.
• Semantics of inhibitor nets
• Efficient Contextual Unfolding
• McMillan’s Complete Prefix for Contextual Nets
• On the Computation of McMillan’s Prefix for Contextual Nets and Graph Grammars
• Contextual occurrence nets and concurrent constraint programming

This page was built for publication: Efficient unfolding of contextual Petri nets