Bisimulations up-to for the linear time branching time spectrum

Lecture Notes in Computer Science

Volumn 3653, Issue , 2005, Pages 278-292

  De Frutos Escrig, David ^a   Rodríguez, Carlos Gregorio ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; EQUIVALENCE CLASSES; FINITE AUTOMATA; SEMANTICS; SPECTRUM ANALYSIS;

BISIMULATIONS; LINEAR TIME BRANCHING TIME SPECTRUM; SEMANTIC EQUIVALENCES; VAN GLABBEEK'S SPECTRUM;

LINEAR SYSTEMS;

EID: 27244438447     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11539452_23     Document Type: Conference Paper

References (19)

1. [BG03] Michele Boreale and Fabio Gadducci. Denotational testing semantics in coinductive form. In Branislav Rovan and Peter Vojtás, editors, 28th International Symposium, MFCS 2003, volume 2747 of Lecture Notes in Computer Science, pages 279-289. Springer, 2003.
2. [CH92] Ranee Cleaveland and Matthew Hennessy. Testing equivalence as a bisimulation equivalence. Formal Aspects of Computing, 3:1-21, 1992.
3. [CS96] Rance Cleaveland and Scott A. Smolka. Strategic directions in concurrency research. ACM Computing Surveys., 28(4):607-625, 1996.
4. [dFG04] David de Frutos-Escrig and Carlos Gregorio-Rodríguez, Semantics equivalences defined with global bisimulations. Annual meeting of the IFIP Working Group 2.2, Bertinoro, Italy, September 2004.
5. [dFLN99] David de Frutos-Escrig, Natalia López, and Manuel Núñez. Global timed bisimulation: An introduction. In Formal Methods for Protocol Engineering and Distributed Systems, FORTE XII / PSTV XIX, pages 401-416. Kluwer Academic Publishers, 1999.
6. [Gar03] Paul Gardiner. Power simulation and its relation to traces and failures refinement. Theoretical Computer Science, 309:157-176, 2003.
7. [Gla01] Rob J. van Glabbeek. Handbook of Process Algebra, chapter The Linear Time - Branching Time Spectrum 1: The Semantics of Concrete, Sequential Processes, pages 3-99. Elsevier, 2001.
8. [Jac04] Bart Jacobs. Trace semantics for coalgebras. In CMCS'04: 7th International Workshop on Coalgebraic Methods in Computer Science, volume 106 of Electronic Notes in Theoretical Computer Science. Elsevier, 2004.
9. [JH03] Bart Jacobs and Jesse Hughes. Simulations in coalgebra. In CMCS'03: 6th International Workshop on Coalgebraic Methods in Computer Science, volume 82 of Electronic Notes in Theoretical Computer Science. Elsevier, 2003.
10. [Kli04] Bartek Klin. A coalgebraic approach to process equivalence and a coinductive principle for traces. In CMCS'04: 7th International Workshop on Coalgebraic Methods in Computer Science, volume 106 of Electronic Notes in Theoretial Computer Science. Elsevier, 2004.
11. [KM02a] Antonín Kucera and Richard Mayr. Why is simulation harder than bisimulation? In CONCUR 2002 - Concurrency Theory, 13th International Conference, Proceedings, volume 2421 of Lecture Notes in Computer Science, pages 594-610. Springer, 2002.
12. [KM02b] Antonín Kucera and Richard Mayr. Simulation preorder over simple process algebra. Information and Computation, 173(2):184-198, 2002.
13. [KS03] Bartek Klin and Pawel Sobocinski. Syntactic formats for free. In 14th International Conference, CONCUR 2008 - Concurrency Theory, Proceedings, volume 2761 of Lecture Notes in Computer Science, pages 72-86. Springer, 2003.
14. [Mil89] Robin Milner. Communication and Concurrency. Prentice Hall, 1989.
15. [Par81] David M.R. Park. Concurrency and automata on infinite sequences. In Theoretical Computer Science, 5th GI-Conference, volume 104 of Lecture Notes in Computer Science, pages 167-183. Springer, 1981.
16. [Plo81] Gordon D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
17. [Rut03] Jan J. M. M. Rutten. Behavioural differential equations: a coinductive calculus of streams, automata, and power series. Theoretical Computer Science, 308(1-3):1-53, 2003.
18. [San98] Davide Sangiorgi. On the bisimulation proof method. Journal of Mathematical Structures in Computer Science, 8(5):447-479, 1998.
19. [SM92] D. Sangiorgi and R. Milner. The problem of "Weak Bisimulation up to". In W.R. Cleveland, editor, Proc. CONCUR'92, volume 630 of Lecture Notes in Computer Science, pages 32-46. Springer, 1992.