Model checking using net unfoldings
From MaRDI portal
Publication:5044767
Recommendations
Cites work
- A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets
- Branching processes of Petri nets
- scientific article; zbMATH DE number 4096790 (Why is no real title available?)
- scientific article; zbMATH DE number 4096792 (Why is no real title available?)
- scientific article; zbMATH DE number 193318 (Why is no real title available?)
- scientific article; zbMATH DE number 408787 (Why is no real title available?)
- scientific article; zbMATH DE number 3325547 (Why is no real title available?)
- Petri nets, event structures and domains. I
Cited in
(10)- Model checking using net unfoldings
- Unfoldings: A partial-order approach to model checking.
- scientific article; zbMATH DE number 1670845 (Why is no real title available?)
- scientific article; zbMATH DE number 1696453 (Why is no real title available?)
- scientific article; zbMATH DE number 1755148 (Why is no real title available?)
- scientific article; zbMATH DE number 1759606 (Why is no real title available?)
- scientific article; zbMATH DE number 1798186 (Why is no real title available?)
- A structural approach for the analysis of Petri nets by reduced unfoldings
- A class of composable high level Petri nets
- The asynchronous committee meeting problem
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 Q5044767)