Deadlock checking using net unfoldings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1254, Issue , 1997, Pages 352-363

  Melzer, Stephan ^a   Römer, Stefan ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

PETRI NETS;

BACKTRACKING ALGORITHM; DEADLOCK DETECTION; FAST IMPLEMENTATION; PETRI NET SYSTEMS; UNFOLDINGS;

COMPUTER AIDED ANALYSIS;

EID: 84947434482     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63166-6_35     Document Type: Conference Paper

References (12)

1. E. Best and C. Ferns Nonsequential Processes-A Petri Net View. EATCS Monographs on Theoretical Computer Science 13 (1988).
2. CPLEX 3.0 Manual, CPLEX Corp. (1995).
3. James C. Corbett: Evaluating Deadlock Detection Methods. University of Hawaii at Marion (1994).
4. J. Engelfriet: Branching processes of Petri nets. Acta Informatica 28, pp. 575-591 (1991).
5. J. Esparza, S. RSmer 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).
6. H. Hellwagner: Scalable Readers/Writers Synchronization on Shared-Memory Machines, Esprit P5404 (GP MIMD), Working Paper (1993).
7. 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).
8. K.L. McMillan: Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circtfits. Proc. 4th Workshop on Computer Aided Verification, LNCS 663, 164-174 (1992).
9. S. Melzer and J. Esparza: Checking System Properties via Integer Programming. In Proc. of European Syrup. on Programming, LNCS 1058, 250-264 (1996).
10. T. Murata: Petri nets: Properties, Analysis and Applications. In Proc. of the IEEE 77(4), pp. 541-580 (1989).
11. M. Nielsen, G. Plotkin and G. Winskel: Petri Nets, Event Structures and Domains. Theoretical Computer Science 13(1), pp. 85-108 (1980).
12. S. Römer: Implementation of a Compositional Partial Order Semantics of Petri Boxes. Diploma Thesis (in German). Universits Hfldesheim (1993).