Skip to main content
Conference ProceedingsOPEN ACCESS

Deadlock checking using net unfoldings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1997) 1254 352-363
DOI: 10.1007/3-540-63166-6_35
50Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Melzer, S., & Römer, S. (1997). Deadlock checking using net unfoldings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1254, pp. 352–363). Springer Verlag. https://doi.org/10.1007/3-540-63166-6_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free