Sciweavers

522 search results - page 74 / 105
» Real-time Logics: Complexity and Expressiveness
Sort
View
MFCS
2009
Springer
14 years 3 months ago
Synthesis for Structure Rewriting Systems
Abstract. The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in w...
Lukasz Kaiser
SPIN
2007
Springer
14 years 2 months ago
Towards Model Checking Spatial Properties with SPIN
Abstract. We present an approach for the verication of spatial properties with Spin. We rst extend one of Spin's main property specication mechanisms, i.e., the linear-time...
Alberto Lluch-Lafuente
TACAS
2007
Springer
116views Algorithms» more  TACAS 2007»
14 years 2 months ago
Model Checking on Trees with Path Equivalences
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
Rajeev Alur, Pavol Cerný, Swarat Chaudhuri
STACS
1994
Springer
14 years 17 days ago
Reachability and the Power of Local Ordering
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
Kousha Etessami, Neil Immerman
FSTTCS
2008
Springer
13 years 9 months ago
Runtime Monitoring of Metric First-order Temporal Properties
ABSTRACT. We introduce a novel approach to the runtime monitoring of complex system properties. In particular, we present an online algorithm for a safety fragment of metric first...
David A. Basin, Felix Klaedtke, Samuel Müller...