Abstract
In this paper, we aim at synthesizing an executable specification for a real-time system by integrating real-time scenarios into a timed automaton. A scenario represents a partial description of a system behavior. A formal semantics is given for the model of a scenario and is used to compile a scenario into a timed automaton. The compilation algorithm is generalized to integrate several scenarios into a single timed automaton which simulates the behaviors specified by the scenarios. The results of the compilation algorithm are independent of the order in which the scenarios are added.
Partially supported by France Telecom
Chapter PDF
References
Rajeev Alur, Costas Courcoubetis, and David Dill. Model-checking in dense real-time. Information and Computation, 104(1):2–34, may 1993.
R. Alur and D. Dill. A Theory of Timed Automata. Theoretical Computer Science, 126: 183–235, 1994.
[BFH+92]_A. Bouajjani, J.-C. Fernandez, N. Halbwachs, P. Raymond, and C. Ratel. Minimal state graph generation. Science of Computer Programming, 18, 1992.
M. Glinz. An Integrated Formal Model of Scenarios Based on Statecharts. In Software Engineering-ESEC’95, pages 254–271. Springler LNCS 989, 1995.
Thomas A. Henzinger, Xavier Nicollin, Joseph Sifakis, and Sergio Yovine. Symbolic model checking for real-time systems. Information and Computation, 111(2), jun 1994.
[HSG+94]_P. Hsia, J. Samuel, J. Gao, D. Kung, Y. Toyoshima, and C. Chen. Formal approach to scenario analysis. IEEE Software, 11:33–41, march 1994.
A. Salah, R. Dssouli, G. Lapalme, and D. Vincent. Vers un environnement de création de services fondé sur les scénarios enrichis. In Proceedings of CFIP, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 IFIP International Federation for Information Processing
About this paper
Cite this paper
Salah, A., Dssouli, R., Lapalme, G. (2001). Compiling Real-time Scenarios into a Timed Automaton. In: Kim, M., Chin, B., Kang, S., Lee, D. (eds) Formal Techniques for Networked and Distributed Systems. FORTE 2001. IFIP International Federation for Information Processing, vol 69. Springer, Boston, MA. https://doi.org/10.1007/0-306-47003-9_9
Download citation
DOI: https://doi.org/10.1007/0-306-47003-9_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-7470-1
Online ISBN: 978-0-306-47003-5
eBook Packages: Springer Book Archive