62 search results - page 10 / 13 » Boolean Abstraction for Temporal Logic Satisfiability |
142
click to vote
TCS
2008
15 years 4 months ago
2008
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...
137
click to vote
CONCUR
2009
Springer
15 years 8 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...
115
click to vote
DEON
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper, we combine deontic logic with Alternatingtime Temporal Logic (ATL) into a framework that makes it possible to model and reason about obligations and abilit...
136
click to vote
IJFCS
2006
15 years 4 months ago
2006
The outcome of verifying software is often a `counterexample', i.e., a listing of the actions and states of a behavior not satisfying the specification. In order to understan...
131
click to vote
JCS
2006
15 years 4 months ago
2006
Abstract-- SPKI/SDSI is a standard for issuing authorization and name certificates. SPKI/SDSI can be used to implement a Trust Management System, where the policy for resource acce...