Refinement preserves PLTL properties

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

Volumn 2651, Issue , 2003, Pages 408-420

  Darlot, Christophe ^a   Julliand, Jacques ^a   Kouchnarenko, Olga ^a  

^a UNIVERSITÉ DE FRANCHE COMTÉ   (France)

Author keywords

B event systems; Presevation of PLTL properties; Refinement development

Indexed keywords

SEMANTICS;

AUTOMATIC PROOFS; DYNAMIC PROPERTY; LABELLED TRANSITION SYSTEMS; LINEAR TEMPORAL LOGIC; LOOP INVARIANTS; PRESEVATION OF PLTL PROPERTIES; REACTIVE SYSTEM; REFINEMENT DEVELOPMENT;

MODEL CHECKING;

EID: 33645886022     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44880-2_24     Document Type: Article

References (12)

1. J.-R. Abrial. The B Book. Cambridge University Press - ISBN 0521-496195, 1996.
2. J.-R. Abrial and L. Mussat. Introducing dynamic constraints in B. In Second Conference on the B method, volume 1393 of LNCS, pages 83-128, 1998.
3. F. Bellegarde, C. Darlot, J. Julliand, and O. Kouchnarenko. Reformulate dynamic properties during B refinement and forget variants and loop invariants. In Proc. First Int. Conf. ZB'2000, York, GB, volume 1878 of Lecture Notes in Computer Science, pages 230-249. Springer-Verlag, September 2000.
4. F. Bellegarde, C. Darlot, J. Julliand, and O. Kouchnarenko. How to verify LTL properties on infinite refined systems by proof and model-checking cooperation. In AVIS'01, March 2001.
5. F. Bellegarde, C. Darlot, J. Julliand, and O. Kouchnarenko. Reformulation: a way to combine dynamic properties and B refinement. In J.N. Oliveira and P. Zave, editors, FME'01, volume 2021 of LNCS, pages 2-19, Berlin, Allemagne, March 2001. Springer-Verlag.
6. F. Bellegarde, J. Julliand, and O. Kouchnarenko. Ready-simulation is not ready to express a modular refinement relation. In FASE'2000, volume 1783 of LNCS, pages 266-283, April 2000.
7. F. Bellegarde, J. Julliand, and O. Kouchnarenko. Synchronized parallel composition of event systems in B. In D. Bert, J. P. Bowen, M. C. Henson, and K. Robinson, editors, ZB 2002 : Formal specification an development in Z and B, volume 2272 of LNCS, pages 436-457. Springer-Verlag, 2002.
8. D. Bert and F. Cave. Construction of finite labelled transition systems from B abstract systems. In Proc. of the 2nd Int. Conf. on Integrated Formal Methods (IFM 2000), volume 1945 of LNCS, pages 235-254, Dagstuhl, Germany, novembre 2000. Springer-Verlag.
9. M.J. Butler. Stepwise refinement of communicating systems. Science of Computer Programming, 1996.
10. Y. Kesten, Z. Manna, and A. Pnueli. Temporal verification of simulation and refinement. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, A Decade of Concurrency, volume 803 of LNCS, pages 273-346. Springer-Verlag, 1994.
11. L. Lamport. A temporal logic of actions. ACM Transactions On Programming Languages And Systems, TOPLAS, 16(3):872-923, May 1994.
12. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, 1992.