Coping With Strong Fairness

We consider the verification of linear temporal logic (LTL) properties of Petri nets, where the transitions can have both weak and strong fairness constraints. Allowing the transitions to have weak or strong fairness constraints simplifies the modeling of systems in many cases. We use the automata theoretic approach to model checking. To cope with the strong fairness constraints efficiently we employ Streett automata where appropriate. We present memory efficient algorithms for both the emptiness checking and counterexample generation problems for Streett automata.

[1]  Pierre Wolper,et al.  Memory-efficient algorithms for the verification of temporal properties , 1990, Formal Methods Syst. Des..

[2]  Pierre Wolper,et al.  Simple on-the-fly automatic verification of linear temporal logic , 1995, PSTV.

[3]  Courcoubetis M. Vardi P. Wolper M. Yannakakis.  Memory-E cient Algorithms for theVeri cationof Temporal PropertiesC , 1992 .

[4]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[5]  Jean-Michel Couvreur,et al.  On-the-Fly Verification of Linear Temporal Logic , 1999, World Congress on Formal Methods.

[6]  Clarke O. Grumberg.  Eecient Generation of Counterexamples and Witnesses in Symbolic Model Checking , 1994 .

[7]  Pierre Wolper,et al.  Reasoning About Infinite Computations , 1994, Inf. Comput..

[8]  Chin-Laung Lei,et al.  Modalities for Model Checking: Branching Time Logic Strikes Back , 1987, Sci. Comput. Program..

[9]  Professor Dr. Wolfgang Reisig.  Elements of Distributed Algorithms , 1998, Springer Berlin Heidelberg.

[10]  Jan Arne Telle,et al.  Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning , 1995, SWAT.

[11]  Keijo Heljanko.  Model Checking the Branching Time Temporal Logic CTL , 1997 .

[12]  Robert K. Brayton,et al.  Edge-Streett/ Edge-Rabin Automata Environment for , 1994 .

[13]  Amir Pnueli,et al.  Checking that finite state concurrent programs satisfy their linear specification , 1985, POPL.

[14]  Amir Pnueli,et al.  Algorithmic Verification of Linear Temporal Logic Specifications , 1998, ICALP.

[15]  R. P. Kurshan,et al.  Automata-theoretic verification of coordinating processes , 1994 .

[16]  Antti Valmari,et al.  The State Explosion Problem , 1996, Petri Nets.

[17]  Amir Pnueli,et al.  Is the Interesting Part of Process Logic Uninteresting? A Translation from PL to PDL , 1984, SIAM J. Comput..

[18]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[19]  Wolfgang Reisig,et al.  Lectures on Petri Nets I: Basic Models , 1996, Lecture Notes in Computer Science.

[20]  Wolfgang Reisig,et al.  Distributed algorithms: modeling and analysis with Petri nets , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[21]  Shmuel Safra,et al.  Complexity of Automata on Innnite Objects , 1989 .