744 search results - page 2 / 149 » Observations on the Decidability of Transitions |
ICALP
2000
Springer
13 years 9 months ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
CSL
2004
Springer
13 years 10 months ago
2004
Springer
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
ICDT
2003
ACM
13 years 10 months ago
2003
ACM
We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by...
DLOG
2010
13 years 3 months ago
2010
Abstract. This paper investigates Description Logics which allow transitive closure of roles to occur not only in concept inclusion axioms but also in role inclusion axioms. First,...
CONCUR
1991
Springer
13 years 9 months ago
1991
Springer
This paper deals with verification methods based on equivalence relations between labeled transition systems. More precisely, we are concerned by two practical needs: how to effi...