Construction of finite labelled transition systems from B abstract systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1945 LNCS, Issue , 2000, Pages 235-254

  Bert, Didier ^a   Cave, Francis ^a  

^a ZIRST   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ABSTRACT SYSTEMS; INPUT-OUTPUT SYSTEMS; LABELLED TRANSITION SYSTEMS; SYSTEMS INTERFACES;

FORMAL METHODS;

EID: 84894542606     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40911-4_14     Document Type: Conference Paper

References (18)

1. J.-R. Abrial. The B Book - Assigning Programs to Meanings. Cambridge University Press, August 1996.
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.
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.
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.
5. S. Bensalem, Y. Lakhnech, and S. Owre. Computing Abstractions of Infinite State Systems Compositionally and Automatically. In Computer-Aided Verification (CAV'98), LNCS 1427. Springer-Verlag, 1998.
6. M. Butler. csp2B: A Practical Approach to Combining CSP and B. In Proc. of the FM'99 - Formal Methods, LNCS 1708, pages 490-508. Springer-Verlag, 1999.
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.
8. D. Dams. Abstract Interpretation and Partition Refinement for Model Checking. PhD thesis, Technical University of Eindhoven, The Netherlands, 1996.
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), LNCS 939. Springer-Verlag, 1995.
10. J.-C. Fernandez, H. Garavel, A. Kerbrat, R. Mateescu, L. Mounier, and M. Sig- hireanu. CADP (Caesar/Aldebaran Development Package): Protocol Validation and Verification Toolbox. In Computer-Aided Verification (CAV'96), LNCS 1102. Springer-Verlag, 1996.
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.
12. S. Graf and H. Saidi. Construction of Abstract State Graphs with PVS. In Computer-Aided Verification (CAV'97), LNCS 1254. Springer-Verlag, 1997.
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.
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.
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.
16. L. Py. Evaluation de specifications formelles B en Programmation Logique avec Contraintes Ensemblistes. PhD thesis, Universite de Franche-Comte, France, 2000.
17. SCSI-2. Small Computer Systems Interface. Technical Report T10-X3.131, American National Standards Institute, USA, 1989.
18. J. Sifakis. A Unified Approach for Studying the Properties of Transition Systems. Theoretical Computer Science, 18:227-258, 1982.