Abstract
McMillan has recently proposed a new technique to avoid the state explosion problem in the verification of systems modelled with finite-state Petri nets. The technique requires to construct a finite initial part of the unfolding of the net. McMillan's algorithm for this task may yield initial parts that are larger than necessary (exponentially larger in the worst case). We present a refinement of the algorithm which overcomes this problem.
Partially supported by the Teilprojekt A3 SAM of the Sonderforschungsbereich 342 “Werkzeuge und Methoden für die Nutzung paralleler Rechnerarchitekturen”.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
E. Best and C. Fernández: Nonsequential Processes — A Petri Net View. EATCS Monographs on Theoretical Computer Science 13 (1988).
James C. Corbett: Evaluating Deadlock Detection Methods. University of Hawaii at Manoa (1994).
V. Diekert: Combinatorics on Traces. LNCS 454 (1990).
J. Engelfriet: Branching processes of Petri nets. Acta Informatica 28, pp. 575–591 (1991).
J. Esparza: Model Checking Using Net Unfoldings. Science of Computer Programming 23, pp. 151–195 (1994).
J. Esparza, S. Römer and W. Vogler: An improvement of McMillan's unfolding algorithm. Informatik Bericht, TU München, in preparation.
M. Kishinevsky, A. Kondratyev, A. Taubin, and V. Varshavsky: Concurrent Hardware: The Theory and Practice of Self-Timed Design, Wiley (1993).
A. Kondratyev and A. Taubin: Verification of speed-independent circuits by STG unfoldings. Proceedings of the Symposium on Advanced Research in Asynchronous Circuits and Systems, Utah (1994).
A. Kondratyev, A. Taubin, M. Kishinevsky and S. Ten: Analysis of Petri Nets by Ordering Relations. Technical Report TR:95-2-002, University of Aizu (1995).
K.L. McMillan: A Technique of a State Space Search Based on Unfolding. Formal Methods in System Design 6(1), pp. 45–65 (1995)
K.L. McMillan: Trace theoretic verification of asynchronous circuits using unfoldings. Proceedings of the 7th Workshop on Computer Aided Verification, Liege (1995).
M. Nielsen, G. Plotkin and G. Winskel: Petri Nets, Event Structures and Domains. Theoretical Computer Science 13(1), pp. 85–108 (1980).
E. Pastor, O. Roig, J. Cortadella and R.M. Badia: Petri Net Analysis Using Boolean Manipulation. Proc. Application and Theory of Petri Nets '94, LNCS 815, pp. 416–435 (1994).
S. Römer: Implementation of a Compositional Partial Order Semantics of Petri Boxes. Diploma Thesis (in German). UniversitÄt Hildesheim (1993).
Author information
Authors and Affiliations
Editor information
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Esparza, J., Römer, S., Vogler, W. (1996). An improvement of McMillan's unfolding algorithm. In: Margaria, T., Steffen, B. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 1996. Lecture Notes in Computer Science, vol 1055. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61042-1_40
Download citation
DOI: https://doi.org/10.1007/3-540-61042-1_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61042-7
Online ISBN: 978-3-540-49874-2
eBook Packages: Springer Book Archive