Sciweavers

1157 search results - page 18 / 232
» Descriptive Complexity and Model Checking
Sort
View
FUIN
2007
104views more  FUIN 2007»
13 years 7 months ago
SAT-Based Reachability Checking for Timed Automata with Discrete Data
Reachability analysis for timed automata using SAT-based methods was considered in many papers, occurring to be a very efficient model checking technique. In this paper we show ho...
Andrzej Zbrzezny, Agata Pólrola
AIIA
2007
Springer
14 years 1 months ago
Structured Hidden Markov Model: A General Framework for Modeling Complex Sequences
Structured Hidden Markov Model (S-HMM) is a variant of Hierarchical Hidden Markov Model that shows interesting capabilities of extracting knowledge from symbolic sequences. In fact...
Ugo Galassi, Attilio Giordana, Lorenza Saitta
ECAI
2008
Springer
13 years 9 months ago
Semantic Modularity and Module Extraction in Description Logics
Abstract. The aim of this paper is to study semantic notions of modularity in description logic (DL) terminologies and reasoning problems that are relevant for modularity. We defin...
Boris Konev, Carsten Lutz, Dirk Walther, Frank Wol...
ICSOC
2007
Springer
14 years 1 months ago
Verifying Temporal and Epistemic Properties of Web Service Compositions
Model checking Web service behaviour has remained limited to checking safety and liveness properties. However when viewed as a multi agent system, the system composition can be ana...
Alessio Lomuscio, Hongyang Qu, Marek J. Sergot, Mo...
FOSSACS
2001
Springer
14 years 14 hour ago
Model Checking CTL+ and FCTL is Hard
Abstract. Among the branching-time temporal logics used for the specification and verification of systems, CTL+ , FCTL and ECTL+ are the most notable logics for which the precise...
François Laroussinie, Nicolas Markey, Ph. S...