Efficient unfolding of contextual Petri nets

DOI10.1016/J.TCS.2012.04.046MaRDI QIDQ443729zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Efficient Contextual Unfolding
• Construction and SAT-based verification of contextual unfoldings
• Verification of Petri nets with read arcs
• scientific article; zbMATH DE number 1799527
• McMillan’s Complete Prefix for Contextual Nets

Cites work

• scientific article; zbMATH DE number 1799527 (Why is no real title available?)
• scientific article; zbMATH DE number 1189293 (Why is no real title available?)
• scientific article; zbMATH DE number 1304999 (Why is no real title available?)
• scientific article; zbMATH DE number 1337888 (Why is no real title available?)
• scientific article; zbMATH DE number 1744959 (Why is no real title available?)
• An improvement of McMillan's unfolding algorithm
• Canonical prefixes of Petri net unfoldings
• Contextual occurrence nets and concurrent constraint programming
• Efficient Contextual Unfolding
• McMillan’s Complete Prefix for Contextual Nets
• Mole
• On the computation of McMillan's prefix for contextual nets and graph grammars
• Semantics of inhibitor nets
• Unfoldings: A partial-order approach to model checking.

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
• Star-topology decoupled state space search
• Construction and SAT-based verification of contextual unfoldings
• Cunf: a tool for unfolding and verifying Petri nets with read arcs
• Non-atomic transition firing in contextual nets
• Branching processes of timed Petri nets
• Methods for Efficient Unfolding of Colored Petri Nets
• Contextual Petri nets, asymmetric event structures, and processes
• On the computation of McMillan's prefix for contextual nets and graph grammars
• 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

Describes a project that uses

Uses Software

• Mole
• Cunf
• Punf

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)