Deciding an interval logic with accumulated durations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4424 LNCS, Issue , 2007, Pages 201-215

  Fränzle, Martin ^a   Hansen, Michael R ^b  

^a UNIVERSITY OF OLDENBURG   (Germany)

^b TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Decidability; Metric time temporal logic; Model checking; Multi priced timed automata; Real time systems

Indexed keywords

AUTOMATA THEORY; BOOLEAN ALGEBRA; COMPUTABILITY AND DECIDABILITY; MODEL CHECKING; PROBLEM SOLVING; REAL TIME SYSTEMS; SET THEORY; CALCULATIONS; FORMAL LOGIC; INTERACTIVE COMPUTER SYSTEMS;

BOOLEAN CONTEXTS; DURATION CALCULUS (DC); METRIC-TIME TEMPORAL LOGIC; MULTI-PRICED TIMED AUTOMATA (MPTA); DURATION CALCULUS; FIRST ORDER LOGIC; INTERVAL LOGIC; LINEAR COMBINATIONS; LINEAR DURATION; REACHABILITY PROBLEM; REAL CLOSED FIELDS; TIMED AUTOMATA;

TEMPORAL LOGIC; REAL TIME SYSTEMS;

EID: 37149028599     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71209-1_17     Document Type: Conference Paper

References (22)

1. R. Alur and D. L. Dill. A theory of timed automata. Theoretical Comput. Sci., 126(2):183-235, 1994.
2. E. Asarin, P. Caspi, and O. Maler. A Kleene theorem for timed automata. In G. Winskel, editor, 12th Annual IEEE Symposium on Logic in Computer Science (LICS'97). IEEE Computer Society Press, 1997.
3. G. Audemard, P. Bertoli, A. Cimatti, A. Kornilowics, and R. Sebastiani. A SAT-based approach for solving formulas over boolean and linear mathematical propositions. In A. Voronkov, editor, Automated Deduction -CADE-18, volume 2392 of Lecture Notes in Computer Science, pages 193-208. Springer-Verlag, 2002.
4. J. Bengtsson, K. Larsen, F. Larsson, P. Pettersson, and W. Yi. Uppaal - a tool suite for automatic verification of real-time systems. In R. Alur, T. Henzinger, and E. Sonntag, editors, Hybrid Systems III - Verification and Control, volume 1066 of Lecture Notes in Computer Science, pages 232-243. Springer-Verlag, 1997.
5. A. Bouajjani, Y. Lakhnech, and R. Robbana. From duration calculus to linear hybrid automata. In P. Wolper, editor, Computer Aided Verification (CAV '95), volume 939 of Lecture Notes in Computer Science. Springer-Verlag, 1995.
6. H. Dierks. Synthesizing controllers from real-time specifications. In Tenth International Symposium on System Synthesis (ISSS '97), pages 126-133. IEEE Computer Society Press, 1997.
7. M. Fränzle. Controller Design from Temporal Logic: Undecidability need not matter. Dissertation, Technische Fakultät der Chr.-Albrechts-Universität Kiel, Germany, 1997.
8. M. Fränzle. Model-checking dense-time duration calculus. Formal Aspects of Computing, 16(2):121-139, 2004.
9. M. Fränzle and C. Herde. Efficient proof engines for bounded model checking of hybrid systems. In J. Bicarregui, A. Butterfield, and A. Arenas, editors, Proceedings Ninth International Workshop on Formal Methods for Industrial Critical Systems (FMICS 04), volume 133 of Electronic Notes in Theoretical Computer Science, pages 119-137. Elsevier Science B.V., 2005.
10. J. Halpern, B. Moszkowski, and Z. Manna. A hardware semantics based on temporal intervals. In J. Diaz, editor, International Colloquium on Automata, Languages, and Programming (ICALP'83), volume 154 of Lecture Notes in Computer Science, pages 278-291. Springer-Verlag, 1983.
11. J. Hoenicke. Combination of Processes, Data and Time. Dissertation, Carl von Ossietzky Universität, Oldenburg, Germany, 2006.
12. Y. Laknech. Specification and Verification of Hybrid and Real-Time Systems. Dissertation, Technische Fakultät der Chr.-Albrechts- Universität Kiel, Germany, 1996.
13. K. G. Larsen and J. I. Rasmussen. Optimal conditional reachability for multipriced timed automata. In V. Sassone, editor, Foundations of Software Science and Computation Structures (FOSSACS '05), volume 3441 of Lecture Notes in Computer Science, pages 230-244. Springer-Verlag, 2005.
14. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems, volume 1. Springer-Verlag, 1992.
15. E.-R. Olderog and H. Dierks. Decomposing real-time specifications. In H. Langmaack, W. de Roever, and A. Pnueli, editors, Compositionality: The Significant Difference, Lecture Notes in Computer Science. Springer-Verlag, 1998.
16. A. P. Ravn. Design of Embedded Real-Time Computing Systems. Doctoral dissertation, Department of Computer Science, Danish Technical University, Lyngby, DK, Oct. 1995. Available as technical report ID-TR: 1995-170.
17. P. Sharma, P. K. Pandya, and S. Chakraborty. Bounded validity checking of interval duration logic. In TACAS 2005, volume 3440 of Lecture Notes in Computer Science. Springer-Verlag, 2005.
18. A. Tarski. A decision method for elementary algebra and geometry. RAND Corporation, Santa Monica, Calif., 1948.
19. Zhou Chaochen and M. R. Hansen. Duration Calculus -A Formal Approach to Real-Time Systems. EATCS monographs on theoretical computer science. Springer-Verlag, 2004.
20. Zhou Chaochen, M. R. Hansen, and P. Sestoft. Decidability and undecidability results for duration calculus. In P. Enjalbert, A. Finkel, and K. W. Wagner, editors, Symposium on Theoretical Aspects of Computer Science (STACS 93), volume 665 of Lecture Notes in Computer Science, pages 58-68. Springer-Verlag, 1993.
21. Zhou Chaochen, C. A. R. Hoare, and A. P. Ravn. A calculus of durations. Information Processing Letters, 40(5):269-276, 1991.
22. Zhou Chaochen, Zhang Jingzhong, Yang Lu, and Li Xiaoshan. Linear duration invariants. In H. Langmaack, W.-P. de Roever, and J. Vytopil, editors, Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT '94), volume 863 of Lecture Notes in Computer Science, pages 86-109. Springer-Verlag, 1994.