Construction of Finite Labelled Transistion Systems from B Abstract Systems

In this paper, we investigate how to represent the behaviour of B abstract systems by finite labelled transition systems (LTS). We choose to decompose the state of an abstract system in several disjunctive predicates. These predicates provide the basis for defining a set of states which are the nodes of the LTS, while the events are the transitions. We have carried out a connection between the B environment (Atelier B) and the Caesar/Aldebaran Development Package (CADP) which is able to deal with LTS. We illustrate the method by developing the SCSI-2 (Small Computer Systems Interface) input-output system. Finally, we discuss about the outcomes of this method and about its applicability.

[1]  Ralph-Johan Back,et al.  Decentralization of Process Nets with Centralized Control , 1983, PODC.

[2]  Laurent Py.  Evaluation de spécifications formelles B en programmation logique avec contraintes ensemblistes : application à l'animation et au model-checking , 2000 .

[3]  Michael J. Butler.  csp2B: A Practical Approach to Combining CSP and B , 1999, World Congress on Formal Methods.

[4]  Yassine Lakhnech,et al.  Computing Abstractions of Infinite State Systems Compositionally and Automatically , 1998, CAV.

[5]  Joseph Sifakis,et al.  Property preserving abstractions for the verification of concurrent systems , 1995, Formal Methods Syst. Des..

[6]  Didier Bert.  B’98: Recent Advances in the Development and Use of the B Method , 1998, Lecture Notes in Computer Science.

[7]  Claire Loiseaux,et al.  A Tool for Symbolic Program Verification and Abstration , 1993, CAV.

[8]  Jürgen Dingel,et al.  Model Checking for Infinite State Systems Using Data Abstraction, Assumption-Commitment Style reasoning and Theorem Proving , 1995, CAV.

[9]  J. R. Abrial,et al.  The B-Book: Mathematics , 1996 .

[10]  Jean-Raymond Abrial,et al.  Introducing Dynamic Constraints in B , 1998, B.

[11]  J. R. Abrial,et al.  The B-Book: Programming , 1996 .

[12]  Dexter Kozen.  Set Constraints and Logic Programming , 1994, CCL.

[13]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[14]  Hassen Saïdi,et al.  Construction of Abstract State Graphs with PVS , 1997, CAV.

[15]  Dennis Dams,et al.  Abstract interpretation and partition refinement for model checking , 1996 .

[16]  Joseph Sifakis,et al.  A Unified Approach for Studying the Properties of Transition Systems , 1982, Theor. Comput. Sci..

[17]  Jean-Raymond Abrial,et al.  The B-book - assigning programs to meanings , 1996 .