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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.R. Burch, E.M. Clarke, and D.E. Long, Symbolic model checking with partitioned transition relations. In the Proceedings of VLSI'91.
J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and J. Hwang, Symbolic model checking: 1020 states and beyond. InProceedings of the Fifth Annual Symposium on Logic in Computer Science, June 1990.
E.M. Clarke and E.A. Emerson, Synthesis of synchronization skeletons for branching time temporal logic. In Dexter Kozen, editor,Logic of Programs: Workshop, volume 131 ofLecture Notes in Computer Science, Yorktown Heights, New York, May 1981. Springer-Verlag.
D. Dill, Trace theory for automatic hierarchical verification of speed-independent circuits. Technical Report 88–119, Carnegie Mellon University, Computer Science Dept., 1988.
P, Godefroid, Using partial orders to improve automatic verification methods. InWorkshop on Computer Aided Verification, 1990.
P. Godefroid and P. Wolper, A partial approach to model checking. InLICS, 1991.
R.P. Kurshan, Testing containment of ω-regular languages. Technical Report 1121-861010-33-TM, Bell Laboratories, 1986.
A.J. Martin, The design of a self-timed circuit for distributed mutual exclusion. In Henry Fuchs, editor,1985 Chapel Hill Conference on VLSI, pp. 245–260. Computer Science Press, 1985.
M. Nielsen, G. Plotkin, and G. Winskel, Petri nets, event structures and domains, part I.Theoretical Computer Science, 13:85–108, 1981.
D.K. Probst and H.F. Li, Abstract specification, composition, and proof of correctness of delay-insensitive circuits and systems. Technical Report, Concordia University, Dept. of Computer Science, 1989.
D.K. Probst and H.F. Li, Using partial order semantics to avoid the state explosion problem in asynchronous systems. InSecond Workshop on Computer Aided Verification, June 1990. Also LNCS 531, pp. 15–24.
D.K. Probst and H.F. Li, Uartial order model checking: A guide for the perplexed. InThird Workshop on Computer Aided Verification, pp. 405–416, July 1991. Also LNCS 575, pp. 322–331.
C.L. Seitz, System timing. In Carver Mead and Lynn Conway, editors,Introduction to VLSI Systems, pp. 218–262. Addison-Wesley, 1980.
A. Valmari, Stubborn sets for reduced state space generation. In10th Int. Conf. on Application and Theory of Petri Nets, 1989.
A. Valmari, A stubborn attack on the state explosion problem. InWorkshop on Computer Aided Verification, 1990.
Tomohiro Yoneda, Yoshihiro Tohma, and Yutaka Kondo, Acceleration of timing verification method based on time Petri Nets.Systems and Computers in Japan, 22(12):37–52, 1991.
Additional information
School of Computer Science, Carnegie Mellon University
Rights and permissions
About this article
Cite this article
McMillan, K.L., Probst, D.K. A technique of state space search based on unfolding. Form Method Syst Des 6, 45–65 (1995). https://doi.org/10.1007/BF01384314
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01384314