Model checking using net unfoldings

DOI10.1016/0167-6423(94)00019-0MaRDI QIDQ1346682zbMATH OpenOpenAlexFDO

Authors Javier Esparza

Publication date 10 April 1995

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6423(94)00019-0

zbMATH Keywords

Petri netsdeadlock detection

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Model checking using net unfoldings
• scientific article; zbMATH DE number 1744959
• Unfoldings: A partial-order approach to model checking.
• scientific article; zbMATH DE number 1670845
• scientific article; zbMATH DE number 910719
• Model checking
• scientific article; zbMATH DE number 1696453
• scientific article; zbMATH DE number 1696824

Cited in

(36)

• Petri nets with causal time for system verification
• scientific article; zbMATH DE number 1759606 (Why is no real title available?)
• Modeling, analyzing and slicing periodic distributed computations
• scientific article; zbMATH DE number 1755148 (Why is no real title available?)
• scientific article; zbMATH DE number 1822435 (Why is no real title available?)
• Natural projection as partial model checking
• Constructing a Knowledge Base for Gene Regulatory Dynamics by Formal Concept Analysis Methods
• A causal semantic for time Petri nets
• Branching processes of timed Petri nets
• Time processes for time Petri nets
• Unfolding Graph Transformation Systems: Theory and Applications to Verification
• Improved implementations via a new structural equivalence on labeled nets
• Verification of bounded Petri nets using integer programming
• The on-line diagnosis of time Petri nets
• Domain and event structure semantics for Petri nets with read and inhibitor arcs
• scientific article; zbMATH DE number 1798186 (Why is no real title available?)
• scientific article; zbMATH DE number 1670845 (Why is no real title available?)
• An improvement of McMillan's unfolding algorithm
• Transformations in Reconfigurable Place/Transition Systems
• scientific article; zbMATH DE number 1759626 (Why is no real title available?)
• Directed Unfolding of Petri Nets
• Trellis processes: a compact representation for runs of concurrent systems
• Computer Aided Verification
• scientific article; zbMATH DE number 1696453 (Why is no real title available?)
• Complexity results for 1-safe nets
• A framework for the verification of infinite-state graph transformation systems
• Petri games: synthesis of distributed systems with causal memory
• scientific article; zbMATH DE number 1670797 (Why is no real title available?)
• Model checking using net unfoldings
• A method for the verification of a distributed and synchronized algorithm
• Solving high-level Petri games
• ``Truly concurrent and nondeterministic semantics of discrete-time Petri nets
• Symbolic unfolding of parametric stopwatch Petri nets
• scientific article; zbMATH DE number 7278100 (Why is no real title available?)
• Deadlock detection-oriented unfolding of unbounded Petri nets
• The synthesis problem for repeatedly communicating Petri games

This page was built for publication: Model checking using net unfoldings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1346682)