257 search results - page 42 / 52 » The Complexity of Model Checking for Propositional Default L... |
JAIR
2008
13 years 7 months ago
2008
Model checking is a promising technology, which has been applied for verification of many hardware and software systems. In this paper, we introduce the concept of model update to...
COCOON
2003
Springer
14 years 22 days ago
2003
Springer
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
SPIN
2010
Springer
13 years 5 months ago
2010
Springer
In our earlier work we have proposed using the declarative language DecSerFlow for modeling, analysis and enactment of processes in autonomous web services. DecSerFlow uses constra...
JAIR
2010
13 years 6 months ago
2010
We present DCL-PC: a logic for reasoning about how the abilities of agents and coalitions of agents are altered by transferring control from one agent to another. The logical foun...
DAGSTUHL
2003
13 years 9 months ago
2003
Abstract. In this paper, we show how the concepts of objects, components, features and agents are used today in the Agent Building Center (ABC) environment in order to marry the mo...