Skip to main content
SpringerLink
Log in

Construction of Finite Labelled Transition Systems from B Abstract Systems

  • Conference paper
  • First Online:
Integrated Formal Methods (IFM 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1945))

Included in the following conference series:

Abstract

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 Cæsar/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.

This work was partly supported by INRIA Rhône-Alpes, through the action VER- DON (VERification et test de systémes rèactifs critiques comportant des DONnées), http://www.inrialpes.fr/vasy/verdon/.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.-R. Abrial. The B Book-Assigning Programs to Meanings. Cambridge University Press, August 1996.

    Google Scholar 

  2. J.-R. Abrial. Extending B without changing it (for developing distributed systems). In H. Habrias, editor, Proc. of the 1st Conference on the B Method, pages 169–191. IRIN, Nantes, France, ISBN 2-906082-25-2, 1996.

    Google Scholar 

  3. J.-R. Abrial and L. Mussat. Introducing Dynamic Constraints in B. In D. Bert, editor, Recent Advances in the Development and Use of the B Method, Proc. of the 2nd International B Conference, LNCS 1393, pages 83–128. Springer-Verlag, 1998.

    Chapter  Google Scholar 

  4. R. J. R. Back and R. Kurki-Suonio. Decentralisation of Process Nets with Centralised Control. In Proc. of the 2nd ACM SIGACT-SIOPS Symp. on Principles of Distributed Computing, 1983.

    Google Scholar 

  5. S. Bensalem, Y. Lakhnech, and S. Owre. Computing Abstractions of Infinite State Systems Compositionally and Automatically. In Computer-Aided Verification (CAV’98), LNCS1427. Springer-Verlag, 1998.

    Google Scholar 

  6. M. Butler. csp2B: A Practical Approach to Combining CSP and B. In Proc. of the FM’99-Formal Methods, LNCS1708, pages 490–508. Springer-Verlag, 1999.

    Google Scholar 

  7. P. Cousot and R. Cousot. Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In 4th POPL. ACM, 1977.

    Google Scholar 

  8. D. Dams. Abstract Interpretation and Partition Refinement for Model Checking. PhD thesis, Technical University of Eindhoven, The Netherlands, 1996.

    MATH  Google Scholar 

  9. J. Dingel and Th. Filkorn. Model Checking for Infinite State Systems using Data Abstraction, Assumption-committment Style Reasonning and Theorem Proving. In Computer-Aided Verification (CAV’95), LNCS939. Springer-Verlag, 1995.

    Google Scholar 

  10. J.-C. Fernandez, H. Garavel, A. Kerbrat, R. Mateescu, L. Mounier, and M. Sighireanu. CADP (Caesar/Aldebaran Development Package): Protocol Validation and Verification Toolbox. In Computer-Aided Verification (CAV’96), LNCS 1102. Springer-Verlag, 1996.

    Google Scholar 

  11. S. Graf and C. Loiseaux. A Tool for Symbolic Program Verification and Abstraction. In Computer-Aided Verification (CAV’93), LNCS 697. Springer-Verlag, 1993.

    Google Scholar 

  12. S. Graf and H. Saidi. Construction of Abstract State Graphs with PVS. In Computer-Aided Verification (CAV’97), LNCS 1254. Springer-Verlag, 1997.

    Google Scholar 

  13. D. Kozen. Set Constraints and Logic Programming. In Proc. of the 1st Int. Conference on Constraints in Computational Logics, LNCS 845. Springer-Verlag, 1994.

    Google Scholar 

  14. B. Legeard, H. Lombardi, and E. Legros et al. A Constraint Satisfaction Approach to Set Unification. In Int. Conf. on Artificial Intelligence, Expert System and Natural Languages, pages 265–276, 1993.

    Google Scholar 

  15. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property Preserving Abstractions for the Verification of Concurrent Systems. Formal Methods in System Design, 6:1–36, 1995.

    Article  Google Scholar 

  16. L. Py. Evaluation de spécifications formelles B en Programmation Logique avec Contraintes Ensemblistes. PhD thesis, Université de Franche-Comté, France, 2000.

    Google Scholar 

  17. SCSI-2. Small Computer Systems Interface. Technical Report T10-X3.131, American National Standards Institute, USA, 1989.

    Google Scholar 

  18. J. Sifakis. A Unified Approach for Studying the Properties of Transition Systems. Theoretical Computer Science, 18:227–258, 1982.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire Logiciels, Systèmes, R’eseaux, LSR-IMAG, Grenoble, France

    Didier Bert & Francis Cave

Authors
  1. Didier Bert
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francis Cave
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Sekr.FR 5-13 bzw.5-6, TU Berlin, Franklinstr.28-29, 10587, Berlin, Germany

    Wolfgang Grieskamp  & Thomas Santen  & 

  2. School of Computing and Mathematics, University of Teesside, Middlesbrough, TS1 3BA, UK

    Bill Stoddart

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bert, D., Cave, F. (2000). Construction of Finite Labelled Transition Systems from B Abstract Systems. In: Grieskamp, W., Santen, T., Stoddart, B. (eds) Integrated Formal Methods. IFM 2000. Lecture Notes in Computer Science, vol 1945. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40911-4_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-40911-4_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41196-3

  • Online ISBN: 978-3-540-40911-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation