279 search results - page 30 / 56 » Timed Temporal Logics for Abstracting Transient States |
182
click to vote
DATE
2009
IEEE
16 years 28 days ago
2009
IEEE
—A large part of a modern SOC’s debug complexity resides in the interaction between the main system components. ion-level debug moves the abstraction level of the debug process...
167
click to vote
ICLP
2007
Springer
16 years 10 days ago
2007
Springer
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
145
click to vote
ECAI
2006
Springer
15 years 9 months ago
2006
Springer
In this paper, we show how to establish correctness and time bounds (e.g., quality of service guarantees) for multi-agent systems composed of communicating rule-based agents. The f...
173
click to vote
CAV
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...
164
click to vote
CONCUR
2009
Springer
15 years 10 months ago
2009
Springer
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...