A technique of state space search based on unfolding
From MaRDI portal
Publication:1346650
DOI10.1007/BF01384314zbMath0829.68085OpenAlexW1965237160MaRDI QIDQ1346650
Publication date: 10 April 1995
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01384314
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (25)
Structure-based deadlock checking of asynchronous circuits ⋮ Petri nets semantics of reaction rules (RR). A language for ecosystems modelling ⋮ Efficient semantics-based compliance checking using LTL formulae and unfolding ⋮ Multilevel transitive and intransitive non-interference, causally ⋮ Courcelle's theorem -- a game-theoretic approach ⋮ Untanglings: a novel approach to analyzing concurrent systems ⋮ An efficient algorithm for the parallel solution of high-dimensional differential equations ⋮ Failures: Their Definition, Modelling and Analysis ⋮ ``Truly concurrent and nondeterministic semantics of discrete-time Petri nets ⋮ Deadlock prevention policy with behavioral optimality or suboptimality achieved by the redundancy identification of constraints and the rearrangement of monitors ⋮ A structural approach for the analysis of Petri Nets by reduced unfoldings ⋮ Occurrence Nets Then and Now: The Path to Structured Occurrence Nets ⋮ Timed Petri nets and timed automata: On the discriminating power of Zeno sequences ⋮ Relational structures for concurrent behaviours ⋮ A Programming Language for Spatial Distribution of Net Systems ⋮ Flow Unfolding of Multi-clock Nets ⋮ Non-interference by Unfolding ⋮ Scheduling analysis of FMS: an unfolding timed Petri nets approach ⋮ Unnamed Item ⋮ Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic ⋮ Combining free choice and time in Petri nets ⋮ Realizability of Schedules by Stochastic Time Petri Nets with Blocking Semantics ⋮ Planning without state space explosion: Petri net to Markov decision process ⋮ A Theory of Distributed Markov Chains ⋮ Control of safe ordinary Petri nets using unfolding
Cites Work
This page was built for publication: A technique of state space search based on unfolding
