80 search results - page 4 / 16 » On the Complexity of Reasoning in Kleene Algebra |
94
Voted
FM
2003
Springer
15 years 3 months ago
2003
Springer
Counterexamples explain why a desired temporal logic property fails to hold, and as such are considered to be the most useful form of output from model-checkers. Multi-valued model...
104
Voted
LICS
2010
IEEE
14 years 8 months ago
2010
IEEE
Stream circuits are a convenient graphical way to represent streams (or stream functions) computed by finite dimensional linear systems. We present a sound and complete expression...
124
Voted
LICS
2000
IEEE
15 years 2 months ago
2000
IEEE
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
90
Voted
KI
2005
Springer
15 years 3 months ago
2005
Springer
The point algebra is a fundamental formal calculus for spatial and temporal reasoning. We present a new generalization that meets all requirements to describe dependencies on netw...
84
Voted
LPAR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The mechanisation of proofs for probabilistic systems is particularly challenging due to the verification of real-valued properties that probability entails: experience ...