475 search results - page 65 / 95 » Temporal Logic Model Checking (Abstract) |
110
click to vote
STACS
2001
Springer
15 years 5 months ago
2001
Springer
Using an automata-theoretic approach, we investigate the decidability of liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on ...
120
click to vote
FUIN
2007
15 years 1 months ago
2007
The paper presents a method of abstraction for timed systems. To extract an abstract model of a timed system we propose to use static analysis, namely a technique called path compr...
147
click to vote
POPL
2011
ACM
14 years 4 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
103
click to vote
TCS
2002
15 years 1 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...
109
click to vote
ICLP
1995
Springer
15 years 4 months ago
1995
Springer
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...