An improvement of McMillan's unfolding algorithm
From MaRDI portal
Recommendations
Cited in
(49)- A theory of structural stationarity in the \(\pi\)-calculus
- STG decomposition strategies in combination with unfolding
- Multilevel transitive and intransitive non-interference, causally
- Star-topology decoupled state space search
- Spreading nets: a uniform approach to unfoldings
- Detection of temporal anomalies for partially observed timed PNs
- Pomset bisimulation and unfolding for reset Petri nets
- Unfolding of parametric Boolean networks
- Verification of concurrent programs using Petri net unfoldings
- Symbolic unfolding of parametric stopwatch Petri nets
- QoS-aware management of monotonic service orchestrations
- On the well-foundedness of adequate orders used for construction of complete unfolding prefixes
- Parameter space abstraction and unfolding semantics of discrete regulatory networks
- Trellis processes: a compact representation for runs of concurrent systems
- Realizability of schedules by stochastic time Petri nets with blocking semantics
- Process Mining Reloaded: Event Structures as a Unified Representation of Process Models and Event Logs
- An algorithm for direct construction of complete merged processes
- Efficient Contextual Unfolding
- A FAST ALGORITHM FOR STALLINGS' FOLDING PROCESS
- Unfolding Graph Transformation Systems: Theory and Applications to Verification
- What topology tells us about diagnosability in partial order semantics
- Directed Unfolding of Petri Nets
- McMillan’s Complete Prefix for Contextual Nets
- Efficient semantics-based compliance checking using LTL formulae and unfolding
- Critical paths in the partial order unfolding of a stochastic Petri net
- scientific article; zbMATH DE number 3986532 (Why is no real title available?)
- Computing the reveals relation in occurrence nets
- Recent advances in unfolding technique
- The sweep-line state space exploration method
- Efficient unfolding of contextual Petri nets
- A structural approach for the analysis of Petri nets by reduced unfoldings
- Hyper partial order logic
- Goal-driven unfolding of Petri nets
- Flow unfolding of multi-clock nets
- Construction and SAT-based verification of contextual unfoldings
- Merging relations: a way to compact Petri nets' behaviors uniformly
- Star-Topology Decoupling in SPIN
- A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
- Cut-off theorems for the \textit{PV}-model
- Avoid one's doom: finding cliff-edge configurations in Petri nets
- Taking complete finite prefixes to high level, symbolically
- Computing a parametric reveals relation for bounded equal-conflict Petri nets
- Taking complete finite prefixes to high level, symbolically
- (Un)decidability bounds of the synthesis problem for Petri games
- Control of safe ordinary Petri nets using unfolding
- Model checking \(\omega \)-regular properties with decoupled search
- Merged processes: a new condensed representation of Petri net behaviour
- Verification of bounded Petri nets using integer programming
- Untanglings: a novel approach to analyzing concurrent systems
This page was built for publication: An improvement of McMillan's unfolding algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1600655)
