State Space Reduction Using Partial tau-Confluence

We present an efficient algorithm to determine the maximal class of confluent Τ -transitions in a labelled transition system. Confluent Τ -transitions are inert with respect to branching bisimulation. This allows to use Τ -priorisation, which means that in a state with a confluent outgoing Τ -transition all other transitions can be removed, maintaining branching bisimulation. In combination with the removal of Τ-loops, and the compression of Τ-sequences this yields an efficient algorithm to reduce the size of large state spaces.

[1]  J. F. Groote,et al.  State space reduction using partial τ-confluence , 2000 .

[2]  Mihaela Sighireanu,et al.  Verification of the Link layer protocol of the IEEE-1394 serial bus (FireWire): an experiment with E-LOTOS , 1998, International Journal on Software Tools for Technology Transfer.

[3]  Benjamin C. Pierce,et al.  Linearity and the pi-calculus , 1996, POPL '96.

[4]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

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

[6]  S. P. Luttik.  Description and formal specification of the Link Layer of P1394 , 1997, FME 1997.

[7]  Jan Friso Groote,et al.  Confluence for process verification , 1996 .

[8]  Pierre Wolper,et al.  A Partial Approach to Model Checking , 1994, Inf. Comput..

[9]  David Walker,et al.  Confluence of Processes and Systems of Objects , 1995, TAPSOFT.

[10]  Antti Valmari.  A stubborn attack on state explosion , 1992, Formal Methods Syst. Des..

[11]  Anna Philippou,et al.  On Confluence in the pi-Calculus , 1997, ICALP.

[12]  Jan Friso Groote,et al.  A Correctness Proof of a One-Bit Sliding Window Protocol in µCRL , 1993, Comput. J..

[13]  Jan Friso Groote,et al.  Confluence for Process Verification , 1995, Theor. Comput. Sci..

[14]  Scott A. Smolka,et al.  CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.

[15]  Robert E. Tarjan,et al.  Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[16]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[17]  Jan Friso Groote,et al.  An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence , 1990, ICALP.