1138 search results - page 165 / 228 » First-Order Model Checking Problems Parameterized by the Mod... |
192
click to vote
QEST
2007
IEEE
16 years 8 days ago
2007
IEEE
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...
139
click to vote
LICS
2005
IEEE
15 years 11 months ago
2005
IEEE
Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words...
144
click to vote
AAAI
2000
15 years 7 months ago
2000
Equivalency clauses (Xors or modulo 2 arithmetics) represent a common structure in the SAT-encoding of many hard real-world problems and constitute a major obstacle to DavisPutnam...
173
click to vote
EPEW
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. The adequate system performance is usually a critical requirement to be checked during the verification phase of a system. Thus, accurately measuring the performance of c...
170
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Metric Temporal Logic (MTL) is a prominent specification formalism for realtime systems. In this paper, we show that the satisfiability problem for MTL over finite tim...