Abstract
We have presented in this paper some procedures of an algorithm which provide from the requirements a syntactic expression representing the temporal behavior of a specification. This expression can be used as a syntactic analyzer, to recognize valid traces. The composition process allows also to reject incompatible traces.
A software tool supporting this work is being implemented. The perspective of the present work is to develop a formal basis for every type of constraints that will allow to build automatically a language acceptor for valid temporal constraints. All this part is used to extend actual software engineering method as SA-RT and Statecharts for the specification of reactive systems.
Preview
Unable to display preview. Download preview PDF.
References
B. Dasarathy. Timing constraints of real_time systems: construct for expressing them, methods of validating them. IEEE transaction Software Engineering, 11:80–86, 1985.
D. Delfieu and A.E.K Sahraoui. Expression and verification of temporal constraints for real-time systems. In 7th Annual European Computer Conference. IEEE, 1993.
J. E. Hopcroft and J. D. Ullman. Introduction to automata theory, languages and computation. Addison Wesley, 1979.
C. Miguel, A. Fernandez, and L. Vidaller. Extended lotos towards performance evaluation. In FORTE'92, 1992.
R. Milner. A Calculus of Communicating Systems. Lecture Notes in Computer Science, 1980.
J. Quemada et al. Introduction to lotos. Comett Alice, may 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag London Limited
About this paper
Cite this paper
Delfieu, D., Sahraoui, A.E.K. (1994). Automata timing specification. In: Cohen, G., Quadrat, JP. (eds) 11th International Conference on Analysis and Optimization of Systems Discrete Event Systems. Lecture Notes in Control and Information Sciences, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0033540
Download citation
DOI: https://doi.org/10.1007/BFb0033540
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19896-3
Online ISBN: 978-3-540-39345-0
eBook Packages: Springer Book Archive