Model checking using net unfoldings
From MaRDI portal
Publication:1346682
DOI10.1016/0167-6423(94)00019-0zbMath0834.68087OpenAlexW2087409327MaRDI QIDQ1346682
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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Domain and event structure semantics for Petri nets with read and inhibitor arcs, Branching Processes of Timed Petri Nets, Modeling, analyzing and slicing periodic distributed computations, The synthesis problem for repeatedly communicating Petri games, Verification of bounded Petri nets using integer programming, Solving high-level Petri games, Unfolding Graph Transformation Systems: Theory and Applications to Verification, Transformations in Reconfigurable Place/Transition Systems, ``Truly concurrent and nondeterministic semantics of discrete-time Petri nets, A framework for the verification of infinite-state graph transformation systems, Complexity results for 1-safe nets, Trellis processes: a compact representation for runs of concurrent systems, Petri games: synthesis of distributed systems with causal memory, Symbolic unfolding of parametric stopwatch Petri nets, Unnamed Item, A method for the verification of a distributed and synchronized algorithm, Constructing a Knowledge Base for Gene Regulatory Dynamics by Formal Concept Analysis Methods, Directed Unfolding of Petri Nets, Unnamed Item, A causal semantic for time Petri nets, The On-Line Diagnosis of Time Petri Nets
