Verifying Bisimulations "On the Fly"

This paper describes a decision procedure for bisimulation-based equivalence relations between labeled transition systems. The algorithm usually performed in order to verify bisimulation consists in refining some initial equivalence relation until it becomes compatible with the transition relation under consideration. However, this method requires to store the transition relation explicitly, which limits it to medium-sized labeled transition systems. The algorithm proposed here does not need to previously construct the two transition systems: the verification can be performed during their generation. Thus, the amount of memory required can be significantly reduced, and verification of larger size systems becomes possible. This algorithm has been implemented in the tool Aldébaran and has been used in the framework of verification of Lotos specifications.

[1]  Jean-Claude Fernandez.  ALDEBARAN : un système de vérification par réduction de processus communicants. (Aldebaran : a system of verification of communicating processes by using reduction) , 1988 .

[2]  Hubert Garavel,et al.  Compilation et vérification de programmes LOTOS , 1989 .

[3]  Joseph Sifakis,et al.  Readiness Semantics for Regular Processes with Silent Actions , 1987, ICALP.

[4]  Jean-Claude Fernandez.  Ald Ebaran: a Tool for Veriication of Communicating Processes , 1989 .

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

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

[7]  Joseph,et al.  Compilation and Veriication of Lotos Speciications , 1990 .

[8]  Thierry Jéron,et al.  On-Line Model Checking for Finite Linear Temporal Logic Specifications , 1989, Automatic Verification Methods for Finite State Systems.

[9]  Juan Quemada,et al.  Transforming LOTOS Specifications with LOLA - The Parameterised Expansion , 1988, FORTE.

[10]  Rob J. van Glabbeek,et al.  Branching Time and Abstraction in Bisimulation Semantics (Extended Abstract) , 1989, IFIP Congress.

[11]  Gerard J. Holzmann,et al.  Algorithms for Automated Protocol Validation , 1988 .

[12]  Joseph Sifakis,et al.  Compilation and verification of LOTOS specifications , 1990, PSTV.

[13]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[14]  Carlos Rodriguez.  Spécification et validation de systèmes en Xesar , 1988 .