Part of the Lecture Notes in Computer Science book series LNCS, volume Abstract Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols see [ 23 ] for a survey. Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of real-time systems whose correctness depends on relative magnitudes of different delays. Consequently, timed automata [ 7 ] were introduced as a formal notation to model the behavior of real-time systems. Its definition provides a simple way to annotate state-transition graphs with timing constraints using finitely many real-valued clock variables. Automated analysis of timed automata relies on the construction of a finite quotient of the infinite space of clock valuations.
|Published (Last):||10 April 2015|
|PDF File Size:||6.51 Mb|
|ePub File Size:||6.11 Mb|
|Price:||Free* [*Free Regsitration Required]|
Our definition provides a simple, and yet powerful, way to annotate state-transition graphs with timing constraints using finitely many real-valued clocks. A timed automaton accepts timed words — strings in which a real-valued time of occurrence is associated with each symbol.
We study timed automata from the perspective of formal language theory: we consider closure properties, decision problems, and subclasses. We discuss the application of this theory to automatic verification of real-time requirements of finite-state systems. This is a preview of subscription content, log in to check access. Preview Unable to display preview. Download preview PDF. Model-checking for real-time systems. Model-checking for probabilistic real-time systems. The benefits of relaxing punctuality.
Google Scholar [Alu91] Rajeev Alur. PhD thesis, Stanford University, Burch, E. Clarke, D. Dill, L. Hwang, and K. Symbolic model checking: states and beyond. On a decision method in restricted second-order arithmetic. Stanford University Press, Clarke, I. Draghicescu, and R. Technical report, Carnegie Mellon University, Allen Emerson, and A. Prasad Sistla. Automatic verification of finite-state concurrent systems using temporal-logic specifications. Journal of Computer and System Sciences, —, Minimum and maximum delay problems in real-time systems.
Synthesizing processes and schedulers from temporal specifications. Google Scholar [EC82] E. Allen Emerson and Edmund M. Using branching-time temporal logic to synthesize synchronization skeletons. Science of Computer Programming, —, A partial approach to model-checking.
Google Scholar [Hoa78] C. Communicating sequential processes. Communications of the ACM, 21 8 —, Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Google Scholar [Kur87] Robert Kurshan. Journal of Computer and System Sciences, —71, What good is temporal logic?
Elsevier Science Publishers, Testing and generating infinite sequences by a finite automaton. Information and Control, —, The temporal framework for concurrent programs. Boyer and J. Moore, editors, The correctness problem in Computer science, pages — Academic Press, Google Scholar [Pnu77] Amir Pnueli.
The temporal logic of programs. Google Scholar [Pnu86] Amir Pnueli. Applications of temporal logic to the specification and verification of reactive systems: a survey of current trends.
Springer-Verlag, Google Scholar [Rog67] Hartley Rogers. Theory of Recursive Functions and Effective Computability. McGraw-Hill, Google Scholar [Saf88] Shmuel Safra. Theoretical Computer Science, 49, Google Scholar [Tho90] Wolfgang Thomas. Automata on infinite objects. Google Scholar [Var87] Moshe Vardi. Verification of concurrent programs — the automata-theoretic framework. An automata-theoretic approach to automatic program verification.
The control of dense real-time discrete event systems. Reasoning about infinite computation paths. Google Scholar Copyright information.
The theory of timed automata
A Theory of Timed Automata