Sciweavers

149 search results - page 3 / 30
» SAT-based Unbounded Model Checking of Timed Automata
Sort
View
FORMATS
2004
Springer
13 years 11 months ago
Model-Checking for Weighted Timed Automata
We study the model-checking problem for weighted timed automata and the weighted CTL logic by the bisimulation approach. Weighted timed automata are timed automata extended with co...
Thomas Brihaye, Véronique Bruyère, J...
IJCSA
2007
84views more  IJCSA 2007»
13 years 6 months ago
Real Time Model Checking Using Timed Concurrent State Machines
Timed Concurrent State Machines are an application of Alur’s Timed Automata concept to coincidence-based (rather than interleaving) CSM modeling technique. TCSM support the idea...
Wiktor B. Daszczuk
FOSSACS
2011
Springer
12 years 9 months ago
A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...
Naoki Kobayashi
CONCUR
2009
Springer
13 years 10 months ago
Time-Bounded Verification
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
Joël Ouaknine, Alexander Rabinovich, James Wo...
ENTCS
2006
96views more  ENTCS 2006»
13 years 6 months ago
Weighted Timed Automata: Model-Checking and Games
In this paper, we present weighted/priced timed automata, an extension of timed automaton with costs, and solve several interesting problems on that model. Key words: Weighted/pri...
Patricia Bouyer