Abstract
A model automaton is simulated by a specification automaton if every externally observable transition by the model can also be matched by the specification. In this work, we establish a new formulation of simulation from a model TA to a specification TA. The new formulation allows us to develop a simulation-checking algorithm, in greatest fixpoint style, with zones. We also present a technique to construct an under-approximation of the set of state-pairs to be removed in a fixpoint iteration. The technique does not sacrifice the exactness of our algorithm and could enhance the performance of simulation-checking. Finally, we report the performance of an implementation of our algorithms.
The work is partially supported by NSC, Taiwan, ROC under grants NSC 95-2221-E-002-067 and NSC 95-2221-E-002-072. A complete version of the manuscript with all lemma proofs has been archived by ACM Computing Research Repository (CoRR) with PaperID: cs.LO/0610085 on Oct. 14, 2006.
This is a preview of subscription content, log in via an institution to check access.
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
Alur, R., Courcoubetis, C., Dill, D.L.: Model Checking for Real-Time Systems. In: IEEE LICS (1990)
Alur, R., Courcoubetis, C., Henzinger, T.A., Ho, P.-H.: Hybrid Automata: an Algorithmic Approach to the Specification and Verification of Hybrid Systems. In: Grossman, R.L., Ravn, A.P., Rischel, H., Nerode, A. (eds.) Hybrid Systems. LNCS, vol. 736, Springer, Heidelberg (1993)
Alur, R., Dill, D.L.: A Theory of Timed Automata. Theoretical Computer Science 126, 183–235 (1994)
Aceto, L., Ingólfsdóttir, A., Pedersen, M.L., Poulsen, J.: Characteristic Formulae for Timed Automata. Theoretical Informatics and Applications 34(6), 565–584 (2000)
Bengtsson, J., Griffioen, W.O.D., Kristoffersen, K.J., Larsen, K.G., Larsson, F., Pettersson, P., Wang, Y.: Verification of an Audio Protocol with Bus Collision Using UPPAAL. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, Springer, Heidelberg (1996)
Beyer, D.: Efficient Reachability Analysis and Refinement Checking of Timed Automata Using BDDs. In: Margaria, T., Melham, T.F. (eds.) CHARME 2001. LNCS, vol. 2144, Springer, Heidelberg (2001)
Bengtsson, J., Larsen, K., Larsson, F., Pettersson, P., Wang, Y.: UPPAAL - a Tool Suite for Automatic Verification of Real-Time Systems. In: Hybrid Control System Symposium. LNCS, Springer, Heidelberg (1996)
Cerans, K.: Decidability of bisimulation equivalence for parallel timer processes. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol. 663, Springer, Heidelberg (1993)
Cleaveland, R., Steffen, B.: Computing behavioral relations, logically. In: Leach Albert, J., Monien, B., Rodríguez-Artalejo, M. (eds.) Automata, Languages and Programming. LNCS, vol. 510, pp. 127–138. Springer, Heidelberg (1991)
Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: IEEE FOCS 1995 (1995)
Henzinger, T.A., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic Model Checking for Real-Time Systems. In: IEEE LICS (1992)
Lin, H., Wang, Y.: Axiomatising timed automaton. Acta Informatica 38(4), 277–305 (2002)
Nakata, A.: Symbolic Bisimulation Checking and Decomposition of Real-Time Service Specifications. Ph.D. Dissertation, Faculty of the Engineering Science, Osaka University (1997)
TaşIran, S., Alur, R., Kurshan, R.P., Brayton, R.K.: Verifying abstractions of timed systems. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, Springer, Heidelberg (1996)
Wang, F.: Efficient Verification of Timed Automata with BDD-like Data-Structures, STTT (Software Tools for Technology Transfer), 6(1) (2004) Springer-Verlag; special issue for the 4th VMCAI, January 2003, LNCS 2575, Springer-Verlag
Wang, F.: Symbolic Parametric Safety Analysis of Linear Hybrid Systems with BDD-like Data-Structures. IEEE Transactions on Software Engineering, 31(1), 38–51 (2005) IEEE Computer Society. A preliminary version is in proceedings of 16th CAV, 2004, LNCS 3114, Springer-Verlag
Wang, F.: Symbolic Verification of Distributed Real-Time Systems with Complex Synchronizations. In: Lau, K.-K., Banach, R. (eds.) ICFEM 2005. LNCS, vol. 3785, Springer, Heidelberg (2005)
Wang, F., Huang, G.-D., Yu, F.: TCTL Inevitability Analysis of Dense-Time Systems: From Theory to Engineering. IEEE Transactions on Software Engineering 32(7) (2006)
Kronos, S.Y.: A Verification Tool for Real-Time Systems. International Journal of Software Tools for Technology Transfer 1(1/2) (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, F. (2007). Symbolic Simulation-Checking of Dense-Time Automata. In: Raskin, JF., Thiagarajan, P.S. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2007. Lecture Notes in Computer Science, vol 4763. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75454-1_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-75454-1_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75453-4
Online ISBN: 978-3-540-75454-1
eBook Packages: Computer ScienceComputer Science (R0)