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

Authors:
Ashish Chiplunkar;Shankara Narayanan Krishna;Chinmay Jain
Affiliations:
Department of Computer Science and Engineering, IIT Bombay, India;Department of Computer Science and Engineering, IIT Bombay, India;Department of Computer Science and Engineering, IIT Bombay, India
Venue:
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Year:
2009

Citing 9
Cited 1

A theory of timed automata

Theoretical Computer Science
Solving systems of strict polynomial inequalities

Journal of Symbolic Computation
Minimum-Cost Reachability for Priced Timed Automata

HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Optimal Paths in Weighted Timed Automata

HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Scheduling with timed automata

Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
On the optimal reachability problem of weighted timed automata

Formal Methods in System Design
On model-checking timed automata with stopwatch observers

Information and Computation
On optimal timed strategies

FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Optimal conditional reachability for multi-priced timed automata

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures

MSO logics for weighted timed automata

Formal Methods in System Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the model of priced timed automata, an extension of timed automata and study the model checking problem of logic WCTL with multi constrained modalities. For simple modalities, it is known that this is decidable [10] for one clock priced timed automata, and is not [14] when the number of clocks is more than one. For the model of priced timed automata with 2 stopwatch costs having no discrete costs, we give an algorithm for model checking the existential fragment of WCTL with multi constrained modalities. The algorithm runs in time that is doubly exponential in the size of the input(automaton, formula).