Results 1 
9 of
9
Local temporal logic is expressively complete for cograph dependence alphabets
 In Proceedings of LPAR’01, number 2250 in LNAI
, 2001
"... Abstract. Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in the word case. If we focus on a purely local interpretation of formulae at vertices (or events) of a trace, then the satis ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
Abstract. Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in the word case. If we focus on a purely local interpretation of formulae at vertices (or events) of a trace, then the satisfiability problem of linear temporal logics over traces turns out to be PSPACE–complete. But now the difficult problem is to obtain expressive completeness results with respect to first order logic. The main result of the paper shows such an expressive completeness result, if the underlying dependence alphabet is a cograph, i.e., if all traces are series parallel posets. Moreover, we show that this is the best we can expect in our setting: If the dependence alphabet is not a cograph, then we cannot express all first order properties.
Logics and Automata for Verification: Expressiveness and Decidability Issues
, 2000
"... This dissertation investigates and extends the mathematical foundations of logics and automata for the interleaving and synchronous noninterleaving view of system computations with an emphasis on decision procedures and relative expressive powers, and introduces extensions of these foundations to th ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
This dissertation investigates and extends the mathematical foundations of logics and automata for the interleaving and synchronous noninterleaving view of system computations with an emphasis on decision procedures and relative expressive powers, and introduces extensions of these foundations to the emerging domain of noninterleaving asynchronous computations. System computations are described as occurrences of system actions, and tractable collections of such computations can be naturally represented by finite automata upon which one can do formal analysis. Specifications of system properties are usually described in formal logics, and the question whether the system at hand satisfies its specification is then solved by means of automatatheoretic constructions.
Events, Causality and Symmetry
, 2008
"... The article discusses causal models, such as Petri nets and event structures, how they have been rediscovered in a wide variety of recent applications, and why they are fundamental to computer science. A discussion of their present limitations leads to their extension with symmetry. The consequences ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
The article discusses causal models, such as Petri nets and event structures, how they have been rediscovered in a wide variety of recent applications, and why they are fundamental to computer science. A discussion of their present limitations leads to their extension with symmetry. The consequences, actual and potential, are discussed.
Local LTL with past constants is expressively complete for Mazurkiewicz traces
 In Proc. of MFCS’03, number 2747 in LNCS
, 2003
"... Abstract. To obtain an expressively complete lineartime temporal logic (LTL) over Mazurkiewicz traces that is computationally tractable, we need to intepret formulas locally, at individual events in a trace, rather than globally, at configurations. Such local logics necessarily require past modalit ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
(Show Context)
Abstract. To obtain an expressively complete lineartime temporal logic (LTL) over Mazurkiewicz traces that is computationally tractable, we need to intepret formulas locally, at individual events in a trace, rather than globally, at configurations. Such local logics necessarily require past modalities, in contrast to the classical setting of LTL over sequences. Earlier attempts at defining expressively complete local logics have used very general past modalities as well as filters (sideconditions) that “look sideways ” and talk of concurrent events. In this paper, we show that it is possible to use unfiltered future modalities in conjunction with past constants and still obtain a logic that is expressively complete over traces.
From local to global temporal logics over Mazurkiewicz traces
 In honour of Professor Christian Choffrut on the occasion of his 60th birthday
"... We review some results on global and local temporal logic on Mazurkiewicz traces. Our main contribution is to show how to derive the expressive completeness of global temporal logic with respect to first order logic [9] from the similar result on local temporal logic [11]. ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We review some results on global and local temporal logic on Mazurkiewicz traces. Our main contribution is to show how to derive the expressive completeness of global temporal logic with respect to first order logic [9] from the similar result on local temporal logic [11].
Automata and Logic
, 2002
"... Contents 1 Introduction 2 2 Finite words 4 2.1 Firstorder and monadic secondorder logics . . . . . . . . . . 4 2.2 Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3 Infinite words 10 3.1 Closure properties of #automata . . . . . . . . . . . . . . . . 14 4 Infinite trees 21 4 ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Contents 1 Introduction 2 2 Finite words 4 2.1 Firstorder and monadic secondorder logics . . . . . . . . . . 4 2.2 Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3 Infinite words 10 3.1 Closure properties of #automata . . . . . . . . . . . . . . . . 14 4 Infinite trees 21 4.1 Closure properties of tree automata . . . . . . . . . . . . . . . 23 4.2 Complexity . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27 5 The calculus and alternating automata 28 5.1 Syntax and semantics of the calculus . . . . . . . . . . . . . 28 5.2 Alternating automata . . . . . . . . . . . . . . . . . . . . . . . 30 5.3 From the calculus to alternating automata . . . . . . . . . . 32 LaBRI, Domaine Universitaire, btiment A30, 351, cours de la Libration, 33405 Talence Cedex, FRANCE. email:igw@labri.fr; www: http://www.labri.fr/#igw These are notes for EFF Summer School, July 2001, with minor modifications. 5.4 From alternating automata to the calculus . . . . . . . .
Difficult configurations — on the complexity of
, 2005
"... The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also called configuration. The logic is shown to be nonelementary with the main reason for this complexity being the nesting of ..."
Abstract
 Add to MetaCart
The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also called configuration. The logic is shown to be nonelementary with the main reason for this complexity being the nesting of until operators in formulas. The fragment of the logic without the until operator is shown to be EXPSPACEhard. 1
Article Model Checking Properties on Reduced Trace Systems
, 2014
"... algorithms ..."
(Show Context)