72 search results - page 2 / 15 » On the Parallel Complexity of Model Checking in the Modal Mu... |
BCS
2008
13 years 6 months ago
2008
Parity games underlie the model checking problem for the modal
ICLP
1997
Springer
13 years 9 months ago
1997
Springer
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
KR
1998
Springer
13 years 9 months ago
1998
Springer
TIME
2009
IEEE
13 years 11 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...
MFCS
2005
Springer
13 years 10 months ago
2005
Springer
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...