Linear temporal logic and Z refinement

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

Volumn 3116, Issue , 2004, Pages 117-131

  Derrick, John ^a   Smith, Graeme ^b  

^a UNIVERSITY OF KENT   (United Kingdom)

^b UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

LTL; Refinement; Temporal logic; Z

Indexed keywords

CALCULATIONS; COMPUTER CIRCUITS; RECONFIGURABLE HARDWARE; SOFTWARE ENGINEERING; SPECIFICATIONS;

LINEAR TEMPORAL LOGIC; MU-CALCULUS; NON-OBSERVABLE; REFINEMENT; STATE BASED; TEMPORAL LOGIC PROPERTIES; Z SPECIFICATIONS;

TEMPORAL LOGIC;

EID: 24644478097     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27815-3_13     Document Type: Article

References (14)

1. J.R. Abrial. The B Book: Assigning Programs to Meaning. Cambridge University Press, 1996.
2. C. Bolton and J. Davies. A Singleton Failures Semantics for Communicating Sequential Processes. Formal Aspects of Computing, 2002. Under consideration.
3. E. Clarke, O. Grumberg, and D. Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 16(5):1512-1542, 1994.
4. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 2000.
5. C. Darlot, J. Julliand, and O. Kouchnarenko. Refinement preserves PLTL properties. In D. Bert, J.P. Bowen, S. King, and M. Waidén, editors, International Conference of Z and B Users (ZB2003), volume 2651 of Lecture Notes in Computer Science, pages 408-420. Springer Verlag, 2003.
6. J. Derrick and E. Boiten. Refinement in Z and Object-Z, Foundations and Advanced Applications. Springer-Verlag, 2001.
7. J. Derrick and E.A. Boiten. Relational concurrent refinement. Formal Aspects of Computing, 15(1):182-214, November 2003.
8. E. A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 996-1072. Elsevier Science Publishers, 1990.
9. C.B. Jones. Systematic Software Development using VDM. Prentice Hall, 1986.
10. D. Kozen. Results on the prepositional μ-calculus. Theoretical Computer Science, 27:333-354, 1983.
11. 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), 1995.
12. G. Smith. The Object-Z Specification Language. Advances in Formal Methods. Kluwer Academic Publishers, 2000.
13. G. Smith and K. Winter. Proving temporal properties of z specifications using abstraction. In D. Bert, J.P. Bowen, S. King, and M. Waidén, editors, International Conference of Z and B Users (ZB2003), volume 2651 of Lecture Notes in Computer' Science, pages 408-420. Springer Verlag, 2003.
14. J.M. Spivey. The Z Notation: A Reference Manual. Prentice Hall, 2nd edition, 1992.