Abstract
Basing on symbolic transition systems, we propose a novel approach to the semantics of timed processes. A process algebra in which actions may occur within specified time intervals is introduced, together with a notion of bisimulation equivalence, based on standard transition systems.
The language is also equipped with a new, symbolic operational semantics. The latter, contrary to standard operational semantics, gives rise to transition systems which are finitely branching and, for a large class of processes, finite. On top of the symbolic operational semantics, we introduce a notion of symbolic bisimulation, for which a tractable proof technique exists. We then prove that symbolic and standard bisimulations coincide for our processes. A proof system to reason about bisimilarity is also presented. The soundness and completeness proofs for the system take great advantage of the symbolic characterization of bisimilarity.
Work done while the author was at Istituto per Elaborazione dell'Informazione — CNR, Pisa. The work has been partially supported by EEC, HCM Project Express and by CNR within the project “Specifica ad Alto Livello e Verifica di Sistemi Digitali”.
Preview
Unable to display preview. Download preview PDF.
References
R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183–235, 1994.
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.
J.C.M. Baeten and A. Bergstra. Real time process algebra. Formal Aspects of Computing, 3:142–188, 1991.
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.
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.
M. Hennessy and H. Lin. Symbolic bisimulations. Theoretical Computer Science 138:353–389, 1995.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boreale, M. (1996). Symbolic bisimulation for timed processes. In: Wirsing, M., Nivat, M. (eds) Algebraic Methodology and Software Technology. AMAST 1996. Lecture Notes in Computer Science, vol 1101. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014325
Download citation
DOI: https://doi.org/10.1007/BFb0014325
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61463-0
Online ISBN: 978-3-540-68595-1
eBook Packages: Springer Book Archive