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

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

Ashish Chiplunkar, Chinmay Jain, Shankara Narayanan Krishna

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

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (2)

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

This page was built for publication: Model Checking Logic WCTL with Multi Constrained Modalities on One Clock Priced Timed Automata