Since 2014
Petri Nets, Traces, and Local Model Checking
BRICS Report Series
View Archive Info| Field | Value | |
| Title |
Petri Nets, Traces, and Local Model Checking
|
|
| Creator |
Cheng, Allan
|
|
| Description |
It has been observed that the behavioural view of concurrentsystems that all possible sequences of actions are relevant is too generous;not all sequences should be considered as likely behaviours. Takingprogress fairness assumptions into account one obtains a more realisticbehavioural view of the systems. In this paper we consider the problemof performing model checking relative to this behavioural view. Wepresent a CTL-like logic which is interpreted over the model of concurrentsystems labelled 1-safe nets. It turns out that Mazurkiewicz tracetheory provides a natural setting in which the progress fairness assumptionscan be formalized. We provide the first, to our knowledge, set ofsound and complete tableau rules for a CTL-like logic interpreted underprogress fairness assumptions.keywords: fair progress, labelled 1-safe nets, local model checking, maximal traces, partial orders, inevitability
|
|
| Publisher |
Aarhus University
|
|
| Contributor |
—
|
|
| Date |
1995-06-09
|
|
| Type |
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion — |
|
| Format |
application/pdf
|
|
| Identifier |
https://tidsskrift.dk/brics/article/view/19941
10.7146/brics.v2i39.19941 |
|
| Source |
BRICS Report Series; No 39 (1995): RS-39 Petri Nets, Traces, and Local Model Checking
BRICS Report Series; No 39 (1995): RS-39 Petri Nets, Traces, and Local Model Checking 1601-5355 0909-0878 |
|
| Language |
eng
|
|
| Relation |
https://tidsskrift.dk/brics/article/view/19941/17594
|
|
| Rights |
Copyright (c) 2015 BRICS Report Series
|
|