Sciweavers

5 search results - page 1 / 1
» The Complexity of Model Checking in Modal Event Calculi with...
Sort
View
KR
1998
Springer
13 years 9 months ago
The Complexity of Model Checking in Modal Event Calculi with Quantifiers
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
ICLP
1997
Springer
13 years 9 months ago
The Complexity of Model Checking in Modal Event Calculi
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...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
SLP
1994
77views more  SLP 1994»
13 years 6 months ago
Modal Event Calculus
We consider a hierarchy of modal event calculi to represent and reason about partially ordered events. These calculi are based on the model of time and change of Kowalski and Sergo...
Iliano Cervesato, Luca Chittaro, Angelo Montanari
CI
2000
114views more  CI 2000»
13 years 4 months ago
A Guided Tour through Some Extensions of the Event Calculus
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 prop...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
ICFEM
2009
Springer
13 years 2 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...