Goal-driven unfolding of Petri nets
From MaRDI portal
Publication:5111631
DOI10.4230/LIPICS.CONCUR.2017.18zbMATH Open1442.68132arXiv1611.01296MaRDI QIDQ5111631FDOQ5111631
Publication date: 27 May 2020
Full work available at URL: https://arxiv.org/abs/1611.01296
Recommendations
Cites Work
- Dynamic partial-order reduction for model checking software
- Unfoldings: A partial-order approach to model checking.
- An improvement of McMillan's unfolding algorithm
- Canonical prefixes of Petri net unfoldings
- Directed Unfolding of Petri Nets
- Peephole Partial Order Reduction
- Efficient unfolding of contextual Petri nets
- Complexity results for 1-safe nets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Goal-oriented reduction of automata networks
- On the well-foundedness of adequate orders used for construction of complete unfolding prefixes
- Unfolding based alorithms for the reachability problem
Cited In (10)
- A technique of state space search based on unfolding
- Concurrency in Boolean networks
- A lazy query scheme for reachability analysis in Petri nets
- Canonical prefixes of Petri net unfoldings
- Static analysis and stochastic search for reachability problem
- Directed Unfolding of Petri Nets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Unfolding based alorithms for the reachability problem
Uses Software
This page was built for publication: Goal-driven unfolding of Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111631)
