135 search results - page 13 / 27 » Model Checking Timed Automata with One or Two Clocks |
SIGSOFT
2007
ACM
14 years 8 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...
TCS
2002
13 years 7 months ago
2002
We consider the timed automata model of [3], which allows the analysis of realtime systems expressed in terms of quantitative timing constraints. Traditional approaches to real-ti...
DSRT
2008
IEEE
13 years 9 months ago
2008
IEEE
The complexity and the variety of the deployed timedependent systems, as well as the high degree of reliability required for their global functioning, justify the care provided to...
EJWCN
2010
13 years 2 months ago
2010
Model checking (MC) is a formal verification technique which has known and still knows a resounding success in the computer science community. Realizing that the distributed power...
COCO
2010
Springer
13 years 11 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...