Results 1 
6 of
6
The Complexity of Propositional Linear Temporal Logics in Simple Cases
 Information and Computation
, 1998
"... this paper we investigate this issue and consider model checking and satisfiability for all fragments of PLTL obtainable by restricting (1) the temporal connectives allowed, (2) the number of atomic propositions, and (3) the temporal height. Key Words: logic in computer science, computational comple ..."
Abstract

Cited by 49 (1 self)
 Add to MetaCart
this paper we investigate this issue and consider model checking and satisfiability for all fragments of PLTL obtainable by restricting (1) the temporal connectives allowed, (2) the number of atomic propositions, and (3) the temporal height. Key Words: logic in computer science, computational complexity, verification, temporal logic, model checking 1.
LTL is expressively complete for Mazurkiewicz Traces
, 2000
"... A long standing open problem in the theory of (Mazurkiewicz) traces has been the question whether LTL (Linear Time Logic) is expressively complete with respect to the rst order theory. We solve this problem positively for nite and in nite traces and for the simplest temporal logic, which is b ..."
Abstract

Cited by 19 (8 self)
 Add to MetaCart
A long standing open problem in the theory of (Mazurkiewicz) traces has been the question whether LTL (Linear Time Logic) is expressively complete with respect to the rst order theory. We solve this problem positively for nite and in nite traces and for the simplest temporal logic, which is based only on next and until modalities. Similar results were established previously, but they were all weaker, since they used additional past or future modalities. Another feature of our work is that our proof is direct and does not use any reduction to the word case.
Local Logics for Traces
 Journal of Automata, Languages and Combinatorics
, 2000
"... A mucalculus over dependence graph representation of traces is considered. It is shown that the mucalculus cannot express all monadic second order (MSO) properties of dependence graphs. ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
A mucalculus over dependence graph representation of traces is considered. It is shown that the mucalculus cannot express all monadic second order (MSO) properties of dependence graphs.
On the expressiveness of MTL variants over dense time
 In Proceedings of the 5th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS’07), Lecture Notes in Computer Science
, 2007
"... The basic modal operator bounded until of Metric Temporal Logic (MTL) comes in several variants. In particular it can be strict (when it does not constrain the current instant) or not, and matching (when it requires its two arguments to eventually hold together) or not. This paper compares the relat ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
The basic modal operator bounded until of Metric Temporal Logic (MTL) comes in several variants. In particular it can be strict (when it does not constrain the current instant) or not, and matching (when it requires its two arguments to eventually hold together) or not. This paper compares the relative expressiveness of the resulting MTL variants over dense time. We prove that the expressiveness is not affected by the variations when considering nonZeno interpretations and arbitrary nesting of temporal operators. On the contrary, the expressiveness changes for flat
An Expressive Extension of TLC (Extended Abstract)
 In Proceedings of ASIAN’99, number 1742 in LNCS
, 1999
"... A temporal logic of causality (TLC) was introduced by Alur, Penczek and Peled in [1]. It is basically a linear time temporal logic interpreted over Mazurkiewicz traces which allows quantification over causal chains. Through this device one can directly formulate causality properties of distributed s ..."
Abstract
 Add to MetaCart
A temporal logic of causality (TLC) was introduced by Alur, Penczek and Peled in [1]. It is basically a linear time temporal logic interpreted over Mazurkiewicz traces which allows quantification over causal chains. Through this device one can directly formulate causality properties of distributed systems. In this paper we consider an extension of TLC by strengthening the chain quantification operators. We show that our logic TLC adds to the expressive power of TLC. We do so by defining an EhrenfeuchtFraïssé game to capture the expressive power of TLC. We then exhibit a property and by means of this game prove that the chosen property is not definable in TLC. We then show that the same property is definable in TLC. We prove in fact the stronger result that TLC is expressively stronger than TLC exactly when the dependency relation associated with the underlying trace alphabet is not transitive.
Information Societies Technology
"... Models ABSTRACTION + + Infinitestate OntheFly Verification ANALYSIS REACHABILITY SYMBOLIC FINITESTATE ANALYSIS (T 1 ; T 2 ) Concrete Model Finite Abtract Model Abstract Model Infinitestate Finite INFINITESTATE Invariants Figure 2: The general methodology of reachable conf ..."
Abstract
 Add to MetaCart
Models ABSTRACTION + + Infinitestate OntheFly Verification ANALYSIS REACHABILITY SYMBOLIC FINITESTATE ANALYSIS (T 1 ; T 2 ) Concrete Model Finite Abtract Model Abstract Model Infinitestate Finite INFINITESTATE Invariants Figure 2: The general methodology of reachable configurations, and more generally, how to compute and represent this set effectively. One of our main research directions is: ffl Developing efficient techniques to cope with the combinatorial explosion in the size of the models, and to reduce the complexity of the statespace exploration, both in time and memory.