Abstract
As many processes concurrently behave and timing constraints are strict in real-time systems, it is difficult to design real-time systems. For this reason, a hierarchical design method is useful. In the hierarchical design method, it is important to verify whether the low level specification satisfies the high level specification or not. In general, the language inclusion verification method is useful for verifying it. But, as nondeterministic timed automata are not closed under complementation, it is impossible to use the language inclusion verification method.
In this paper, we propose the hierarchical design method based on timed simulation method. Especially, we generalize existing timed simulation methods and propose a safety timed simulation relation and a ∃-liveness timed simulation relation, a ∀-liveness timed simulation relation. Finally, we show our proposed method effective by some example.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Alur, C. Courcoubetis, D. Dill. Model checking for real-time systems. In Proc. of 5th LICS, pp. 414–425, 1992.
R. Alur, D. Dill. The theory of Timed automata. In Lecture Notes in Computer Science 600, pp.45–73, 1992.
J.R. Burch, E.M. Clarke, K.L. McMillan, D. Dill, L.J. Hwang. Symbolic Model Checking: 1020 States and Beyond. In Proc. 5th LICS, pp.428–439, 1990.
R. Cleaveland, J. Parrow, B. Steffen. The concurrency workbench. In Lecture Notes in Computer Science 407, pp.24–37, 1989.
D. Dill, A.J. Hu, H. Wong-Toi. Checking for Language Inclusion Using Simulation Preorders. In Lecture Notes in Computer Science 575, pp.255–265, 1991.
N. Francez. Fairness. In Texts and monographs in computer science, Springer-verlag, P.295, 1986.
J.E. Hopcroft, J.D. Ullman. Introduction to automata theory, languages, computation, P.418, Addison-Wesley PUB., 1979.
IEEE Computer Society. IEEE ANSI/IEEE 802.3, ISO/DIS 8802/3. IEEE Computer Society Press, 1985.
R. Milner. Communication and Concurrency. In Prentice Hall, P.260, 1989.
N.A. Lynch, M.R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proc. of ACM Symp. on Principles of Distributed Computing, pp.137–151, 1987.
N.A. Lynch, H. Attiya. Using mapping to prove timing properties. In Distributed Computing, No.6, pp.121–139, 1992.
S. Tasiran, R. Alur, R.P. Kurshan, R.K. Brayton. Verifying Abstracts of Timed Systems. In LNCS 1119, pp.546–562, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yamane, S. (1999). A Practical Hierarchical Design by Timed Simulation Relations for Real-Time Systems. In: Hutter, D., Stephan, W., Traverso, P., Ullmann, M. (eds) Applied Formal Methods — FM-Trends 98. FM-Trends 1998. Lecture Notes in Computer Science, vol 1641. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48257-1_9
Download citation
DOI: https://doi.org/10.1007/3-540-48257-1_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66462-8
Online ISBN: 978-3-540-48257-4
eBook Packages: Springer Book Archive