Abstract
We discuss the decidability problem associated with verifying properties of processes expressed in the real time process calculus TCCS of [W90], A regular subcalculus TC of TCCS is considered. Two operational semantics, and associated timed notions of bisimulation, are given: a standard infinite semantics, and a symbolic finite semantics. The consistency between the two semantics is proved. We show that both the equivalences are decidable for regular processes relative to comparisons between real numbers.
As an alternative specification formalism, we present a timed modal logic. It turns out that this logic characterises timed bisimulation equivalence in the sense that equivalent processes enjoy exactly the same properties expressed within the logic. Moreover, we prove that the problem of deciding whether a given regular real timed process satisfies a given property of the logic is decidable, relative to first order assertions about real numbers. Two interpretations of the modal logic are offered, based on the standard and symbolic operational semantics of TC respectively and the consistency between these interpretations is proved.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. Alur and D. Dill, Automata for Modelling Real-Time Systems, LNCS 443, 1990.
R. Alur, C.Courcoubetis and D.Dili, Model-Checking for Real-Time Systems, Proceedings from LICS'90 pp. 414–425, 1990.
R. Cleaveland, J. Parrow and B. Steffen, The Concurrency Workbench, LNCS 407, 1989.
M. Hennessy and R. Milner, Algebraic Laws for Nondeterminism and Concurrency, JACM, Vol. 32, pp. 137–161, 1985.
M. Hennessy and T. Regan, A Temporal Process Algebra., Technical Report 2/90, University of Sussex, 1990.
R. Milner, Communication and Concurrency, Prentice Hall International Series in Computer Science, 1989.
F. Moller and C. Tofts, A Tempora Calculus of Communicating Systems, LNCS 458, 1990.
R. Page and R.T. Tarjan, Three Partition Refinement Algorithms, SIAM Journal of Computing, Vol 16, no 6 Dec. 1987.
G.M. Reed and A.W. Roscoe, A Timed Model for Communicating Sequential Processes, LNCS 226, 1986.
J. Sifakis etc. ATP: an Algebra for Timed Processes, Laboratoire de Genie Informatique, IMAG-Campus, B.P.53X, 38041 Grenoble Cedex, France, 1990.
Y. Wang, Real Time Behaviour of Asynchronous Agents, LNCS 458, 1990.
Y. Wang, CCS + Time= an Interleaving Model for Real Time Systems, ICALP'91, Madrid, 1991.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Holmer, U., Larsen, K., Yi, W. (1992). Deciding properties of regular real timed processes. In: Larsen, K.G., Skou, A. (eds) Computer Aided Verification. CAV 1991. Lecture Notes in Computer Science, vol 575. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55179-4_41
Download citation
DOI: https://doi.org/10.1007/3-540-55179-4_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55179-9
Online ISBN: 978-3-540-46763-2
eBook Packages: Springer Book Archive