A Technique of State Space Search Based on Unfolding (1992)
| Venue: | Formal Methods in System Design |
| Citations: | 56 - 0 self |
BibTeX
@INPROCEEDINGS{Mcmillan92atechnique,
author = {K. L. Mcmillan and D. K. Probst},
title = {A Technique of State Space Search Based on Unfolding},
booktitle = {Formal Methods in System Design},
year = {1992},
pages = {45--65}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Unfoldings of Petri nets provide a method of searching the state space of concurrent systems without considering all possible interleavings of concurrent events. A procedure is given for constructing the unfolding of a Petri net, terminating the construction when it is sufficient to represent all reachable markings. This procedure is applied to hazard and deadlock detection in asynchronous circuits. Examples are given of scalable systems with exponential size state spaces, but polynomial size unfoldings, including a distributed mutual exclusion ring circuit.
