257 search results - page 21 / 52 » The Complexity of Model Checking for Propositional Default L... |
CAV
2003
Springer
14 years 25 days ago
2003
Springer
Run-time monitoring of temporal properties and assertions is used for testing and as a component of execution-based model checking techniques. Traditional run-time monitoring howev...
ICALP
2003
Springer
14 years 24 days ago
2003
Springer
A special class of oracle circuits with tree-vector form is introduced. It is shown that they can be evaluated in deterministic polynomial-time with a polylog number of adaptive qu...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
We present a logic for reasoning both about the ability of agents to cooperate to execute complex actions, and how this relates to their ability to reach certain states of affairs...
ACSD
2005
IEEE
14 years 1 months ago
2005
IEEE
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...
ICFEM
2009
Springer
14 years 2 months ago
2009
Springer
Internet protocols encapsulate a significant amount of state, making implementing the host software complex. In this paper, we define the Statecall Policy Language (SPL) which pr...