Symbolic bisimulation for timed processes

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

Volumn 1101, Issue , 1996, Pages 321-335

  Boreale, Michele ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; SOFTWARE ENGINEERING;

BISIMULATION EQUIVALENCES; OPERATIONAL SEMANTICS; PROCESS ALGEBRAS; SOUNDNESS AND COMPLETENESS; SYMBOLIC BISIMULATION; SYMBOLIC TRANSITION SYSTEMS; TIME INTERVAL; TRANSITION SYSTEM;

SEMANTICS;

EID: 84947917717     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0014325     Document Type: Conference Paper

References (8)

1. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, 1994.
2. L. Aceto and D. Murphy. On the ill-timed - but well-caused. In E. Best, editor, Proceedings of CONCUR '93, LNCS 715. Springer-Verlag, Berlin, 1993. Full version to appear in Acta Informatica.
3. J.C.M. Baeten and A. Bergstra. Real time process algebra. Formal Aspects of Computing, 3:142-188, 1991.
4. L. Chen. Axiomatizing real-timed processes. In S. Brooks, M. Main, A. Melton, M. Mislove, and D. Schmidt, editors, Proceedings of MFPS'93, LNCS 802, pages 215-229. Springer-Verlag, Berlin, 1993.
5. W.J. Fokkink and S. Klusener. An effective axiomatization for real time ACP. Technical Report CS-R9542, CWI, Computer Science, 1995. To appear in Information and Computation
6. M. Hennessy and H. Lin. Symbolic bisimulations. Theoretical Computer Science 138:353-389, 1995.
7. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
8. Y. Wang. Real time behaviour of asynchronous agents. In J.C.M. Baeten and J.W. Klop, editors, Proc. 1st Conference on Concurrency Theory (CONCUR'90), LNCS 458. Springer-Verlag, Berlin, 1990.