Sciweavers

1157 search results - page 15 / 232
» Descriptive Complexity and Model Checking
Sort
View
ACSD
2005
IEEE
162views Hardware» more  ACSD 2005»
14 years 1 months ago
Complexity Results for Checking Distributed Implementability
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
Keijo Heljanko, Alin Stefanescu
DLOG
2009
13 years 5 months ago
Model-Based Most Specific Concepts in Some Inexpressive Description Logics
Abstract. Model-based most specific concepts are a non-standard reasoning service in Description Logics. They have turned out to be useful in knowledge base completion for ontologi...
Felix Distel
CLIMA
2008
13 years 9 months ago
Easy Yet Hard: Model Checking Strategies of Agents
Abstract. I present an overview of complexity results for model checking of temporal and strategic logics. Unfortunately, it is possible to manipulate the context so that different...
Wojciech Jamroga
RE
2001
Springer
13 years 12 months ago
The Single Model Principle
at different levels of abstraction. There are two very different ways of using such languages. One approach is based on the manifestation of a single model, with construction of di...
Richard F. Paige, Jonathan S. Ostroff
CD
2005
Springer
14 years 1 months ago
Modelling Deployment Using Feature Descriptions and State Models for Component-Based Software Product Families
Abstract. Products within a product family are composed of different component configurations where components have different variable features and a large amount of dependency re...
Slinger Jansen, Sjaak Brinkkemper