Abstract
Symbolic model checking is a technique for verifying finite-state concurrent systems that has been extended to handle real-time systems. Timed automata are widely used to model such systems behavior. In this paper we are concerned by durational actions timed automata (daTA) which is a timed automata handling action durations and true concurrency. Our aim is to compute efficiently the state space of (daTA) in order to verify quantitative timing requirements and preserve the true concurrency property.
We present a novel approach to compute quantitative information about the system and exploring the state space of daTA based on maximality semantics.
We have designed a new zone graph under the maximality semantics, named Maximality-based Zone Graph (MZG), for describing symbolic execution of daTA. In the implemented tool TaMaZG, daTA description is compiled into a MZG and represented symbolically using the Difference Bounded Matrices data structure (DBM).
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.: Timed Automata. Theoretical Computer Science 126, 183–235 (1999)
Alur, R., Courcoubetis, C., Dill, D.: Model-Checking in Dense Real- Time. Information and Computation 104(1), 2–34 (1993)
Alur, R., Dill, D.: A theory of timed automata. Theoretical Computer Science, 183–235 (1994)
Barbuti, R., De Francesco, N., Tesei, L.: Timed Automata with non-instantaneous Actions. Fundamenta Informaticae-Concurrency Specification and Programming 47(3-4), 189–200 (2001)
Belala, N., Saidouni, D.E., Boukharrou, R., Chaouche, A.C., Seraoui, A., Chachoua, A.: Time Petri Nets with Action Duration: A True Concurrency Real-Time Model. International Journal of Embedded and Real-Time Communication Systems (IJERTCS) 4(2), 62–83 (2013)
Bengtsson, J.: Clocks, DBMs ans States in Timed Systems. Ph.D. thesis, Department of Information Technology, Uppsala University, Uppsala, Sweden (2002)
Bohnenkamp, H., D’Argenio, P.R., Hermanns, H., Katoen, J.P.: MODEST: A compositional modeling formalism for hard and softly timed systems. IEEE Transactions on Software Engineering 32(10), 812–830 (2006)
Bornot, S., Sifakis, J.: On the composition of hybrid systems. In: Henzinger, T.A., Sastry, S.S. (eds.) HSCC 1998. LNCS, vol. 1386, pp. 49–63. Springer, Heidelberg (1998)
Bornot, S., Sifakis, J., Tripakis, S.: Modeling Urgency in Timed Systems. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol. 1536, pp. 103–129. Springer, Heidelberg (1998)
Bouyer, P.: Untameable timed automata! In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 620–631. Springer, Heidelberg (2003)
Bowman, H.: Time and action lock freedom properties for timed automata. In: Proceedings of FORTE 2001, pp. 119–134 (2001)
Bowman, H., Gomez, R.: Concurrency Theory, Calculi and Automata for Modelling Untimed and Timed Concurrent Systems. Springer (2006) ISBN-10: 1-85233-895-4 ISBN-13: 978-1-85233-895-4
Bozga, M., Graf, S., Ober, I., Ober, I., Sifakis, J.: The IF toolset. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 237–267. Springer, Heidelberg (2004)
Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press (2000)
Dierks, H., Kupferschmid, S., Larsen, K.G.: Automatic abstraction refinement for timed automata. In: Raskin, J.-F., Thiagarajan, P.S. (eds.) FORMATS 2007. LNCS, vol. 4763, pp. 114–129. Springer, Heidelberg (2007)
Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol. 407, pp. 197–212. Springer, Heidelberg (1990)
Floyd, R.W.: Algorithm 97: Shortest path. Communications of the ACM 5(6), 345 (1962)
Gomez, R.: Model-checking timed automata with deadlines with Uppaal. Formal Aspects of Computing 25(2), 289–318 (2013)
Guellati, S., Kitouni, I., Saidouni, D.E.: Verification of durational actions timed automata using UPPAAL. International Journal of Computer Applications 56(11), 33–41 (2012)
Kitouni, I., Hachichi, H., Bouaroudj, K., Saidouni, D.E.: Durational Actions Timed Automata: Determinization and Expressiveness. International Journal of Applied Information Systems (IJAIS) 4(2), 1–11 (2012)
Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. International Journal on Software Tools for Technology Transfer 1(1-2), 134–152 (1997)
Nagaoka, T., Okano, K., Kusumoto, S.: An abstraction refinement technique for timed automata based on counterexample-guided abstraction refinement loop. IEICE Transactions on Information and Systems E93-D5(5), 994–1005, 5 (2010)
Pettersson, P.: Modelling and Verification of Real-Time Systems Using Timed Automata. Theory and Practice. PhD thesis, Uppsala University (1999)
Saidouni, D.E., Belala, N.: Actions duration in timed models. In: Proceedings of International Arab Conference on Information Technology (ACIT 2006), Yarmouk University, Irbid, Jordan (2006)
Saidouni, D.E., Belala, N., Bouneb, M.: Aggregation of transitions in marking graph generation based on maximality semantics for petri nets. In: Proceeding of the Second international conference on Verification and Evaluation of Computer and Communication Systems (VECoS 2008), pp. 6–16 (2008)
Yovine, S.: Kronos: A verification tool for real-time systems. International Journal on Software Tools for Technology Transfer 1(1-2), 123–133 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Guellati, S., Kitouni, I., Matmat, R., Saidouni, DE. (2014). Timed Automata with Action Durations – From Theory to Implementation. In: Dregvaite, G., Damasevicius, R. (eds) Information and Software Technologies. ICIST 2014. Communications in Computer and Information Science, vol 465. Springer, Cham. https://doi.org/10.1007/978-3-319-11958-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-11958-8_8
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11957-1
Online ISBN: 978-3-319-11958-8
eBook Packages: Computer ScienceComputer Science (R0)