Abstract
We present a decision algorithm for testing equivalence of realtime systems with a dense time domain. Real-time systems are modelled by timed graphs, while the decision algorithm uses“ mutually refined” timer region graphs. The mutual refinement is important for the synchronization of the timers of different real-time systems. Key to our decision algorithm is the fact that — despite the dense time domain — testing can be reduced to Π-bisimulation in very much the same way as in the untimed case.
We wolid like to thank Rance Cleaveland for pointing out the importance of testing equivalence and several unnamed refrees for comments on this paper.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Alur, C. Courcoubetis, D. Dill. Model-Checking for Real-Time Systems. 5th LICS'90, Philadelphia, PA., Jnn. '90, pp. 414–425
J.C.M. Baeten, J.A. Bergstra. Real-Time Process Algebra. Report P8916b University of Amsterdam, Mar. '90.
K. Čerāns. Decidability of Bisimulation Equivalences for Parallel Timer Processes. in: Proceedings of CAV '92
L. Chen. An Interleaving Model for Real-Time Systems. Report ECS-LFCS-91-184, Univ. of Edinburgh, Nov. '91
R. Cleaveland, J. Parrow, B. Steffen. The Concurrency Workbench. ACM Trans. on Prog. Lang. and Systems, Vol. 15, No. 1, Jan. '93, pp. 36–72.
R. Cleaveland, M. Hennessy. Testing Equivalences as a Bisimulation Equivalence. in: LNCS 407, Springer, New York '89, pp. 11–23
R. Cleaveland, A. Zwarico. A Theory of Testing for Real-Time. 6th LICS '91, Amsterdam, The Netherlands, Jul. '91, pp. 110–119
R. DeNicola, M. Hennessy. Testing Equivalences for Processes. Theoretical Computer Science No. 24, '84, pp. 83–133
W.J. Fokkink. Normal forms in real-time process algebra. Report CS-R9194, CWI, Amsterdam, '91.
U. Holmer, K.G. Larsen, W. Yi. Deciding Properties of Regular Real-Timed Processes. Report R 91-20 University of Aalborg, Jun. '91.
P.C. Kanellakis, S.A. Smolka. CCS Expressions, Finite State Processes, and Three Problems of Equivalence. 2nd PODC, Montreal, Aug. '83, pp. 228–240
T. Margaria, C. Weise. Continuous Real Time Models in Practice. to appear in: Proc. 5th Euromicro Worksh. on Real-Time Systems, Oulu(Finland), Jun. '93
R. Milner. Communication and Concurrency. Prentice-Hall, New York '89
F. Moller, C. Tofts. A Temporal Calculus of Communicating Systems. in: LNCS 458, Springer, New York '90, pp. 401–415
X. Nicollin, J. Sifakis, S. Yovine. From ATP to Timed Graphs and Hybrid Systems. REX Workshop” Real-Time: Theory in Practice”, Jun. '91
G.M. Reed, A.W. Roscoe. A Timed Model for Communicating Sequential Processes. Journal of Theoretical Computer Science 58, '88, pp. 249–261
B. Steffen, C. Weise. Deciding Equivalences for Dense Real-Time Processes. Technical Report. Aachener Informatik Berichte, Aachen University of Technology, to appear.
W. Yi. CCS + Time = an Interleaving Model for Real-Time Systems. in: LNCS 510, Springer, New York '91, pp. 217–228
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Steffen, B., Weise, C. (1993). Deciding testing equivalence for real-time processes with dense time. In: Borzyszkowski, A.M., Sokołowski, S. (eds) Mathematical Foundations of Computer Science 1993. MFCS 1993. Lecture Notes in Computer Science, vol 711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57182-5_61
Download citation
DOI: https://doi.org/10.1007/3-540-57182-5_61
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57182-7
Online ISBN: 978-3-540-47927-7
eBook Packages: Springer Book Archive