1650 search results - page 188 / 330 » The HOM problem is decidable |
129
click to vote
CONCUR
1999
Springer
15 years 8 months ago
1999
Springer
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general se...
126
Voted
ECAI
1994
Springer
15 years 8 months ago
1994
Springer
For large problems the ATMS often becomes the main resource consumer in any reasoning system. We propose an architecture (the 2vATMS) that combines the advantages of two techniques...
146
click to vote
CAV
2009
Springer
15 years 8 months ago
2009
Springer
We consider the decision problem for quantifier-free formulas whose atoms are linear inequalities interpreted over the reals or rationals. This problem may be decided using satisf...
132
click to vote
ICDT
2007
ACM
15 years 8 months ago
2007
ACM
Abstract. We introduce approximate data exchange, by relaxing classical data exchange problems such as Consistency and Typechecking to their approximate versions based on Property ...
124
click to vote
ICALP
2000
Springer
15 years 8 months ago
2000
Springer
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...