1650 search results - page 15 / 330 » The HOM problem is decidable |
FORMATS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
SLOGICA
2008
13 years 6 months ago
2008
We consider the decision problem for cases of first-order temporal logic with function symbols and without equality. The monadic monodic fragment with flexible functions can be dec...
ICALP
2009
Springer
14 years 7 days ago
2009
Springer
We consider an extension of the guarded fragment in which one can guard quanti ers using the transitive closure of some binary relations. The obtained logic captures the guarded fr...
ATVA
2007
Springer
14 years 1 months ago
2007
Springer
State explosion is a fundamental problem in the analysis and synthesis of discrete event systems. Continuous Petri nets can be seen as a relaxation of discrete models. The expected...
PODS
2004
ACM
14 years 7 months ago
2004
ACM
The problem of deciding query containment has important applications in classical query optimization and heterogeneous database systems. Query containment is undecidable for unres...