Action contraction

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

Volumn 1877 LNCS, Issue , 2000, Pages 290-305

  Rensink, Arend ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ATOMIC ACTIONS; FINE GRAINS;

ARTIFICIAL INTELLIGENCE;

EID: 84885217212     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44618-4_22     Document Type: Conference Paper

References (27)

1. L. Aceto and M. C. B. Hennessy. Towards action-refinement in process algebras. Information and Computation, 103: 204-269, 1993.
2. L. Aceto and M. C. B. Hennessy. Adding action refinement to a finite process algebra. Information and Computation, 115: 179-247, 1994.
3. J. C. M. Baeten and W. P. Weijland. Process Algebra. Cambridge University Press, 1990.
4. T. Bolognesi and E. Brinksma. Introduction to the ISO specification language LOTOS. Computer Networks and ISDN Systems, 14: 25-59, 1987.
5. G. Boudol and I. Castellani. Concurrency and atomicity. Theoretical Comput. Sci., 59: 25-84, 1988.
6. E. Brinksma, B. Jonsson, and F. Orava. Refining interfaces of communicating systems. In S. Abramsky and T. S. E. Maibaum, eds., TAPSOFT'91, Volume 2, Vol. 494 of Lecture Notes in Computer Science, pp. 297-312. Springer-Verlag, 1991.
7. F. Cherief and P. Schnoebelen. τ-bisimulation and full abstraction for refinement of actions. Information Processing Letters, 40: 219-222, 1991.
8. W. R. Cleaveland, ed. Concur'92, Vol. 630 of Lecture Notes in Computer Science. Springer-Verlag, 1992.
9. R. Gerth, R. Kuiper, and J. Segers. Interface refinement in reactive systems. In W. R. Cleaveland [8], pp. 77-93.
10. R. J. van Glabbeek. The linear time - branching time spectrum II: The semantics of sequential systems with silent moves. In E. Best, ed., Concur'93, Vol. 715 of Lecture Notes in Computer Science, pp. 66-81. Springer-Verlag, 1993.
11. R. J. van Glabbeek and F. W. Vaandrager. Petri Net models for algebraic theories of concurrency. In J. W. de Bakker, A. J. Nijman, and P. C. Treleaven, eds., PARLE - Parallel Architectures and Languages Europe, Volume II: Parallel Languages, Vol. 259 of Lecture Notes in Computer Science, pp. 224-242. Springer-Verlag, 1987.
12. R. J. van Glabbeek and F. W. Vaandrager. The difference between splitting in n and n + 1. Information and Computation, 136(2): 109-142, 1997.
13. R. J. van Glabbeek and W. P. Weijland. Branching time and abstraction in bisimulation semantics. J. ACM, 43(3): 555-600, May 1996.
14. R. Gorrieri and C. Laneve. Split and ST bisimulation semantics. Information and Computation, 116(1): 272-288, Jan. 1995.
15. C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
16. S. Katz. Refinement with global equivalence proofs in temporal logic. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 29: 59-78, 1997.
17. L. Lamport. The mutual exclusion problem, part I - a theory of interprocess communication. J. ACM, 33(2): 313-326, Apr. 1986.
18. R. Langerak. Transformations and Semantics for LOTOS. PhD thesis, University of Twente, Nov. 1992.
19. N. A. Lynch, M. Merritt, W. E. Weihl, and A. Fekete. Atomic Transactions. Morgan Kaufmann, San Mateo, 1994.
20. R. Milner. A Calculus of Communicating Systems, Vol. 92 of Lecture Notes in Computer Science. Springer-Verlag, 1980.
21. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
22. U. Nestmann and B. Pierce. Decoding choice encodings. In U. Montanari and V. Sassone, eds., Concur '96: Concurrency Theory, Vol. 1119 of Lecture Notes in Computer Science, pp. 179-194. Springer-Verlag, 1996.
23. J. Parrow and P. Sjödin. Multiway synchronization verified with coupled simulation. In W. R. Cleaveland [8], pp. 518-533.
24. J. Parrow and P. Sjödin. The complete axiomatization of Cs-congruence. In R. Enjalbert, E. W. Mayr, and K. W. Wagner, eds., STACS 94, Vol. 775 of Lecture Notes in Computer Science, pp. 557-568. Springer-Verlag, 1994.
25. A. Rensink. A theory of action contraction, 2000. Full version (including proofs): http://www.cs.utwente.nl/~rensink/contract.ps.gz.
26. A. Rensink and R. Gorrieri. Vertical implementation. Information and Computation, 2000 (to appear). Extended version of "Vertical Bisimulation," (TAPSOFT'97); see also Hildesheimer Informatik-Bericht 9/98, University of Hildesheim.
27. W. Vogler. Failures semantics based on interval semiwords is a congruence for refinement. Distributed Computing, 4: 139-162, 1991.