Sciweavers

414 search results - page 73 / 83
» Inheritance of Temporal Logic Properties
Sort
View
ICALP
2009
Springer
15 years 12 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
CI
2000
114views more  CI 2000»
14 years 11 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...
SPIN
2010
Springer
14 years 10 months ago
Enacting Declarative Languages Using LTL: Avoiding Errors and Improving Performance
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...
Maja Pesic, Dragan Bosnacki, Wil M. P. van der Aal...
SRDS
1999
IEEE
15 years 4 months ago
Formal Hazard Analysis of Hybrid Systems in cTLA
Hybrid systems like computer-controlled chemical plants are typical safety critical distributed systems. In present practice, the safety of hybrid systems is guaranteed by hazard ...
Peter Herrmann, Heiko Krumm
DFG
2004
Springer
15 years 3 months ago
Modeling and Formal Verification of Production Automation Systems
This paper presents the real-time model checker RAVEN and related theoretical background. RAVEN augments the efficiency of traditional symbolic model checking with possibilities to...
Jürgen Ruf, Roland J. Weiss, Thomas Kropf, Wo...