744 search results - page 7 / 149 » Observations on the Decidability of Transitions |
LPAR
2005
Springer
14 years 2 months ago
2005
Springer
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
KR
2000
Springer
14 years 17 days ago
2000
Springer
We present a new tableaux calculus deciding the ABox consistency problem for the expressive description logic ALCNHR+ . Prominent language features of ALCNHR+ are number restricti...
FOSSACS
2006
Springer
14 years 19 days ago
2006
Springer
We consider parity games played on special pushdown graphs, namely those generated by one-counter processes. For parity games on pushdown graphs, it is known from [22] that decidin...
ACSD
2005
IEEE
14 years 2 months ago
2005
IEEE
We introduce and study problems of distributed observation with bounded or unbounded memory. We are given a system modeled as a finite-word language L over some finite alphabet ...
TPHOL
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract. We consider a formalisation of a notion of observer (or intruder) theories, commonly used in symbolic analysis of security protocols. An observer theory describes the kno...