309 search results - page 10 / 62 » Model Checking Games for Branching Time Logics |
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
We present TECTLK, a logic to specify knowledge and real time in multi-agent systems. We show that the model checking problem is decidable, and we present an algorithm for TECTLK ...
FORMATS
2004
Springer
15 years 2 months ago
2004
Springer
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...
TACAS
2007
Springer
15 years 3 months ago
2007
Springer
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
ITA
2007
14 years 9 months ago
2007
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...
112
click to vote
FM
2003
Springer
15 years 2 months ago
2003
Springer
We present a semantics for fault tree analysis, a technique used for the analysis of safety critical systems, in the real-time interval logic Duration Calculus with Liveness and sh...