Petri Nets, Traces, and Local Model Checking

It has been observed that the behavioural view of concurrent systems that all possible sequences of actions are relevant is too generous; not all sequences should be considered as likely behaviours. Taking progress fairness assumptions into account one obtains a more realistic behavioural view of the 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 the model of concurrent systems labelled 1-safe nets. It turns out that Mazurkiewicz trace theory provides a natural setting in which the progress fairness assumptions can be formalized. We provide the first, to our knowledge, set of sound and complete tableau rules for a CTL-like logic interpreted under progress fairness assumptions. keywords: fair progress, labelled 1-safe nets, local model checking, maximal traces, partial orders, inevitability

[1]  Allan Cheng,et al.  Local Model Checking and Traces , 1994 .

[2]  Franck van Breugel,et al.  From Branching to Linear Metric Domains (and back) , 1995 .

[3]  David Walker,et al.  Local Model Checking in the Modal mu-Calculus , 1991, Theor. Comput. Sci..

[4]  A. C heng.  Complexity Results for Model Checking ? , 1995 .

[5]  Antoni W. Mazurkiewicz,et al.  Trace Theory , 1986, Advances in Petri Nets.

[6]  C. E. Veni Madhavan.  Foundations of Software Technology and Theoretical Computer Science , 1988, Lecture Notes in Computer Science.

[7]  D. Harel.  Recurring dominoes: making the highly undecidable highly understandable , 1985 .

[8]  Ernst-Rüdiger Olderog,et al.  Nets, terms and formulas , 1991 .

[9]  R. Lathe.  Phd by thesis , 1988, Nature.

[10]  Marek Antoni Bednarczyk,et al.  Categories of asynchronous systems , 1987 .

[11]  Mayer Goldberg.  Constructing Fixed-Point Combina- tors Using Application Survival , 1995 .

[12]  Glynn Winskel,et al.  Bisimulation and open maps , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[13]  Robert L. Berger.  The undecidability of the domino problem , 1966 .

[14]  Jens Palsberg.  Efficient Inference of Object Types , 1995, Inf. Comput..

[15]  Allan Cheng.  Petri Nets, Traces, and Local Model Checking , 1995 .

[16]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[17]  P. S. Thiagarajan,et al.  A Logical Study of Distributed Transition Systems , 1995, Inf. Comput..

[18]  Madhavan Mukund,et al.  CCS, Locations and Asynchronous Transition Systems , 1992 .

[19]  Amir Pnueli,et al.  Proving Partial Order Liveness Properties , 1990, ICALP.

[20]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

[21]  Jens Palsberg,et al.  Trust in the λ-calculus , 1995, Journal of Functional Programming.

[22]  M. W. Shields.  Concurrent Machines , 1985, Comput. J..

[23]  Wojciech Penczek,et al.  Concurrent Systems and Inevitability , 1989, Theor. Comput. Sci..

[24]  Jens Palsberg,et al.  Complexity Results for 1-safe Nets , 1993, FSTTCS.

[25]  Glynn Winskel,et al.  Models for Concurrency , 1994 .

[26]  Kim G. Larsen,et al.  Proof System for Hennessy-Milner Logic with Recursion , 1988, CAAP.

[27]  Wolfgang Reisig,et al.  Petri Nets: Applications and Relationships to Other Models of Concurrency , 1986, Lecture Notes in Computer Science.

[28]  Sten Agerholm,et al.  Experiments with ZF Set Theory in HOL and Isabelle , 1995, TPHOLs.

[29]  WOJCIECH PENCZEK,et al.  Temporal Logics for Trace Systems: On Automated Verification , 1993, Int. J. Found. Comput. Sci..

[30]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[31]  Eugene W. Stark,et al.  Concurrent Transition Systems , 1989, Theor. Comput. Sci..

[32]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.