Abstract
Purchase PDF (1621 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (0)
Purchase PDF (2828 K)
doi:10.1016/S0304-3975(96)00326-X 
Copyright © 1997 Published by Elsevier Science B.V.
Contribution
Petri nets, traces, and local model checking*1
Allan Cheng
Available online 13 May 1998.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
It has been observed that representing concurrent behaviour as sequences of interleaved events is not satisfactory — not all sequences should be considered as likely behaviours. Taking progress fairness assumptions into account one obtains a more realistic behavioural view of concurrent systems. In this paper we consider the problem of performing model-checking relative to this behavioural view. We present a CTL-like logic which is interpreted over labelled 1-safe nets. It turns out that Mazurkiewicz trace theory provides a natural setting in which progress fairness assumptions can be formalised. We provide the first, to our knowledge, set of sound and complete tableau rules for a CTL-like logic interpreted under progress fairness assumptions.
Author Keywords: Fair progress; Labelled 1-safe nets; Model-checking; Maximal traces; Partial orders; Inevitability
