49 search results - page 7 / 10 » Symbolic Model Checking of Finite Precision Timed Automata |
133
click to vote
IJBC
2010
15 years 3 months ago
2010
This paper introduces an extension of recurrence analysis to symbolic sequences. Heuristic arguments based on Shannon-McMillan-Breiman theorem suggest several relations between th...
186
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of model checking message-passing systems with real-time requirements. As behavioural specifications, we use message sequence charts (MSCs) annotated with ...
197
click to vote
FORMATS
2006
Springer
15 years 9 months ago
2006
Springer
Recently, a new approach to the symbolic model checking of timed automata based on a partial order semantics was introduced, which relies on event zones that use vectors of event o...
173
click to vote
ROBOCUP
2007
Springer
16 years 5 days ago
2007
Springer
Abstract. This paper shows how multiagent systems can be modeled by a combination of UML statecharts and hybrid automata. This allows formal system cation on different levels of ab...
177
click to vote
SIGSOFT
2007
ACM
16 years 6 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...