Comparing refinements for failure and bisimulation semantics

Fundamenta Informaticae

Volumn 52, Issue 4, 2002, Pages 297-321

  Eshuis, Rik ^a   Fokkinga, Maarten M ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Bisimulation semantics; Decorated traces; Failure semantics; Labelled transition systems; Refinement

Indexed keywords

COMPUTER SIMULATION; COMPUTER SYSTEM RECOVERY; LARGE SCALE SYSTEMS; SPECIFICATIONS;

BISIMULATION SEMANTICS;

SEMANTICS;

EID: 0036817554     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. E. Brinksma, G. Scollo, and C. Steenbergen. LOTOS specifications, their implementations and their tests. In G. Bochmann and B. Sarikaya, editors, Protocol Specification, Testing and Verification VI, pages 349-360. North-Holland, 1987.
2. R. Cleaveland and M. Hennessy. Testing equivalence as a bisimulation equivalence. Formal Aspects of Computing, 5(1):1-20, 1993.
3. R. de Nicola and M.C.B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34(1-2):83-133, November 1984.
4. J. Derrick, H. Bowman, E.A. Boiten, and M. Steen. Comparing LOTOS and Z refinement relations. In FORTE/PSTV'96, pages 501-516. Chapman & HaH, 1996.
5. R.J. van Glabbeek. The linear time-branching time spectrum (extended abstract). In J.C.M. Baeten and J.W. Klop, editors, CONCUR '90, volume 458 of Lecture Notes in Computer Science, pages 278-297, Amsterdam, The Netherlands, 1990. Springer-Verlag.
6. J. He. Process simulation and refinement. Formal Aspects of Computing, 1(3):229-241, 1989.
7. C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
8. K.G. Larsen and A. Skou. Bisimulation through probabilistic testing (preliminary report). In Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, pages 344-352. ACM Press, 1989.
9. N.A. Lynch and F.W. Vaandrager. Forward and backward simulations, I: Untimed systems. Information and Computation, 121(2):214-233, September 1995.
10. R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25(3):267-310, July 1983.
11. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
12. D. Park. Concurrency and automata on infinite sequences. In Peter Deussen, editor, 5th GI-Conference, volume 104 of Lecture Notes in Computer Science, pages 167-183, Berlin, Heidelberg, and New York, 1981. Springer-Verlag.
13. R. van Rein and M.M. Fokkinga. Protocol assuring universal language. In Paolo Ciancarini, Alessandro Fantechi, and Robert Gorrieri, editors, Formal Methods for Open Object-based Distributed Systems, pages 241-258. Kluwer Academic Publishers, 1999.
14. J.M. Spivey. The Znotation - second edition. Prentice Hall, 1992.
15. E. Strijbos and M.M. Fokkinga. Personal communication, 1998.
16. th Annual Symposium on Logic in Computer Science, Amsterdam, pages 387-398. IEEE Computer Society Press, 1991.
17. J. Woodcock and J. Davies. Using Z - Specification, Refinement and Proof. Prentice Hall, 1996.