Sciweavers

60 search results - page 11 / 12
» Practical First-Order Temporal Reasoning
Sort
View
VMCAI
2009
Springer
14 years 1 days ago
Mixed Transition Systems Revisited
—A variety of partial modeling formalisms, aimed re and reason about abstractions, have been proposed. Some, e.g., Kripke Modal Transition Systems (KMTSs) put strong restrictions...
Ou Wei, Arie Gurfinkel, Marsha Chechik
ATAL
2009
Springer
13 years 12 months ago
Combining fault injection and model checking to verify fault tolerance in multi-agent systems
The ability to guarantee that a system will continue to operate correctly under degraded conditions is key to the success of adopting multi-agent systems (MAS) as a paradigm for d...
Jonathan Ezekiel, Alessio Lomuscio
CAV
2004
Springer
126views Hardware» more  CAV 2004»
13 years 9 months ago
An Efficiently Checkable, Proof-Based Formulation of Vacuity in Model Checking
Model checking algorithms can report a property as being true for reasons that may be considered vacuous. Current algorithms for detecting vacuity require either checking a quadrat...
Kedar S. Namjoshi
DAGM
2006
Springer
13 years 9 months ago
Integrating Recognition and Reconstruction for Cognitive Traffic Scene Analysis from a Moving Vehicle
This paper presents a practical system for vision-based traffic scene analysis from a moving vehicle based on a cognitive feedback loop which integrates real-time geometry estimati...
Bastian Leibe, Nico Cornelis, Kurt Cornelis, Luc J...
AAAI
1992
13 years 6 months ago
On the Minimality and Decomposability of Constraint Networks
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
Peter van Beek