Abstract
McMillan presented a deadlock detection technique based on unfoldings of Petri net systems. It is realized by means of a backtracking algorithm that has its drawback for unfoldings that increase widely. We present an approach that exploits precisely this property. Moreover, we introduce a fast implementation of McMillan's algorithm and compare it with our new technique.
This work was supported by the Sonderforschungsbereich SFB-342 A3 SAM.
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).
CPLEX 3.0 Manual, CPLEX Corp. (1995).
James C. Corbett: Evaluating Deadlock Detection Methods. University of Hawaii at Manoa (1994).
J. Engelfriet: Branching processes of Petri nets. Acta Informatica 28, pp. 575–591 (1991).
J. Esparza, S. Römer and W. Vogler: An Improvement of McMillan's Unfolding Algorithm. Proc. of Tools and Algorithms for the Construction and Analysis of Systems, LNCS 1055, 87–106 (1996).
H. Hellwagner: Scalable Readers/Writers Synchronization on Shared-Memory Machines, Esprit P5404 (GP MIMD), Working Paper (1993).
A.J. Martin: The Design of a self-timed Circuit of Distributed Mutual Exclusion. In Henry Fuchs, editor, 1985 Chapel Hill Confernce on VLSI, pp. 245–260. Computer Science Press (1985).
K.L. McMillan: Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits. Proc. 4th Workshop on Computer Aided Verification, LNCS 663, 164–174 (1992).
S. Melzer and J. Esparza: Checking System Properties via Integer Programming. In Proc. of European Symp. on Programming, LNCS 1058, 250–264 (1996).
T. Murata: Petri nets: Properties, Analysis and Applications. In Proc. of the IEEE 77(4), pp. 541–580 (1989).
M. Nielsen, G. Plotkin and G. Winskel: Petri Nets, Event Structures and Domains. Theoretical Computer Science 13(1), pp. 85–108 (1980).
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
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Melzer, S., Römer, S. (1997). Deadlock checking using net unfoldings. In: Grumberg, O. (eds) Computer Aided Verification. CAV 1997. Lecture Notes in Computer Science, vol 1254. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63166-6_35
Download citation
DOI: https://doi.org/10.1007/3-540-63166-6_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63166-8
Online ISBN: 978-3-540-69195-2
eBook Packages: Springer Book Archive