Model Checking Logic WCTL with Multi Constrained Modalities on One Clock Priced Timed Automata

DOI10.1007/978-3-642-04368-0_9zbMath1262.68109MaRDI QIDQ3648825

Shankara Narayanan Krishna, Chinmay Jain, Ashish Chiplunkar

Publication date: 1 December 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04368-0_9

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q45: Formal languages and automata

03D05: Automata and formal grammars in connection with logical questions

68Q60: Specification and verification (program logics, model checking, etc.)

03B44: Temporal logic

Related Items

MSO logics for weighted timed automata, Model Checking Logic WCTL with Multi Constrained Modalities on One Clock Priced Timed Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Model checking weighted integer reset timed automata
• A theory of timed automata
• Solving systems of strict polynomial inequalities
• Scheduling with timed automata
• On the optimal reachability problem of weighted timed automata
• On model-checking timed automata with stopwatch observers
• Model Checking One-clock Priced Timed Automata
• Model Checking Logic WCTL with Multi Constrained Modalities on One Clock Priced Timed Automata
• Hybrid Systems: Computation and Control
• Tools and Algorithms for the Construction and Analysis of Systems
• Automata, Languages and Programming
• Foundations of Software Science and Computational Structures
• Formal Modeling and Analysis of Timed Systems