257 search results - page 26 / 52 » The Complexity of Model Checking for Propositional Default L... |
ISSTA
2000
ACM
13 years 12 months ago
2000
ACM
—Network protocols are often analyzed using simulations. We demonstrate how to extend such simulations to check propositions expressing safety properties of network event traces ...
TARK
2005
Springer
14 years 1 months ago
2005
Springer
s for Multi-Agent Only Knowing (extended abstract) Arild Waaler1,2 and Bjørnar Solhaug3,4 1 Finnmark College, Norway 2 Dep. of Informatics, University of Oslo, Norway 3 SINTEF ICT...
TIME
2009
IEEE
14 years 2 months ago
2009
IEEE
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...
FOSSACS
2007
Springer
14 years 1 months ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
DAC
2005
ACM
13 years 9 months ago
2005
ACM
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...