Sciweavers

9284 search results - page 374 / 1857
» Knowledge State Algorithms
Sort
View
FORMATS
2004
Springer
16 years 20 days ago
Symbolic Model Checking for Simply-Timed Systems
Abstract. We describe OBDD-based symbolic model checking algorithms for simply-timed systems, i.e. finite state graphs where transitions carry a duration. These durations can be a...
Nicolas Markey, Ph. Schnoebelen
ACSD
2004
IEEE
95views Hardware» more  ACSD 2004»
15 years 11 months ago
Guided Model Checking with a Bayesian Meta-heuristic
Abstract. This paper presents a formal verification algorithm for finding errors in models of complex concurrent systems. The algorithm improves explicit guided model checking by a...
Kevin D. Seppi, Michael Jones, Peter Lamborn
CALCO
2007
Springer
118views Mathematics» more  CALCO 2007»
16 years 1 months ago
Coalgebraic Epistemic Update Without Change of Model
Abstract. We present a coalgebraic semantics for reasoning about information update in multi-agent systems. The novelty is that we have one structure for both states and actions an...
Corina Cîrstea, Mehrnoosh Sadrzadeh
IUI
2000
ACM
15 years 11 months ago
Requirements elicitation for an intelligent software test environment for the physically challenged
This paper is about the elicitation of the requirements for an intelligent interface for a software test development environment that will accommodate the physically challenged (P...
Warren Moseley
EUROCRYPT
2007
Springer
15 years 11 months ago
Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...
Yi Deng, Dongdai Lin