In this paper, we develop theoretical, as well as practical, tools for the synthesis and the verification of processes that contain n timers. Such tools are equally adapted to numerical calculations as to symbolical ones, thus allowing for parametric analysis. The results we have obtained rely on a simple and efficient representation of the states of an automaton that recognizes the behaviors of the process. This representation is based on a mechanical structure which helps us encode the states in a compact manner and leads to simple algorithms.
CITATION STYLE
Bergeron, A., & Catalano, R. (2001). Analysis of reactive systems with n timers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2214, pp. 27–38). Springer Verlag. https://doi.org/10.1007/3-540-45526-4_3
Mendeley helps you to discover research relevant for your work.