Sciweavers

2022 search results - page 177 / 405
» Complexity of Non-Monotonic Logics
Sort
View
CONCUR
2004
Springer
15 years 12 months ago
Model Checking Restricted Sets of Timed Paths
In this paper, we study the complexity of model-checking formulas of three important real-time logics (MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of rest...
Nicolas Markey, Jean-François Raskin
FORMATS
2003
Springer
15 years 11 months ago
Discrete-Time Rewards Model-Checked
Abstract. This paper presents a model-checking approach for analyzing discrete-time Markov reward models. For this purpose, the temporal logic probabilistic CTL is extended with re...
Suzana Andova, Holger Hermanns, Joost-Pieter Katoe...
ASYNC
2002
IEEE
114views Hardware» more  ASYNC 2002»
15 years 11 months ago
Checking Delay-Insensitivity: 104 Gates and Beyond
Wire and gate delays are accounted to have equal, or nearly equal, effect on circuit behavior in modern design techniques. This paper introduces a new approach to verify circuits ...
Alex Kondratyev, Oriol Roig, Lawrence Neukom, Karl...
CADE
2000
Springer
15 years 11 months ago
An Infrastructure for Intertheory Reasoning
Abstract. The little theories method, in which mathematical reasoning is distributed across a network of theories, is a powerful technique for describing and analyzing complex syst...
William M. Farmer
LPNMR
1997
Springer
15 years 10 months ago
Improving the Alternating Fixpoint: The Transformation Approach
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...
Ulrich Zukowski, Burkhard Freitag, Stefan Brass