Results 1 
5 of
5
Pure future local temporal logics are expressively complete for Mazurkiewicz traces
 Conference version in LATIN 2004, LNCS 2976
"... Mazurkiewicz traces ⋆ ..."
(Show Context)
Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces
 In CONCUR’05, Lecture Notes in Comp. Science
, 2005
"... Abstract. We continue our study of the complexity of temporal logics over concurrent systems that can be described by Mazurkiewicz traces. In a previous paper (CONCUR 2003), we investigated the class of local and MSO definable temporal logics that capture all known temporal logics and we showed that ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
(Show Context)
Abstract. We continue our study of the complexity of temporal logics over concurrent systems that can be described by Mazurkiewicz traces. In a previous paper (CONCUR 2003), we investigated the class of local and MSO definable temporal logics that capture all known temporal logics and we showed that the satisfiability problem for any such logic is in PSPACE (provided the dependence alphabet is fixed). In this paper, we concentrate on the uniform satisfiability problem: we consider the dependence alphabet (i.e., the architecture of the distributed system) as part of the input. We prove lower and upper bounds for the uniform satisfiability problem that depend on the number of monadic quantifier alternations present in the chosen MSOmodalities. 1
Uniform satisfiability problem for local temporal logics over . . .
 INFORMATION AND COMPUTATION
, 2010
"... ..."
Logical Fragments for Mazurkiewicz Traces: Expressive Power and Algebraic Characterizations
"... fflfflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl ffl ffl fflffl ffl ..."
Abstract
 Add to MetaCart
fflfflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl fflffl ffl ffl fflffl ffl
Truly Concurrent Logic via InBetween Specification
"... In order to obtain a formalism for the specification of true concurrency in reactive systems, we modify the µcalculus such that properties that are valid during the execution of an action can be expressed. The interpretation of this logic is based on transition systems that are used to model the ST ..."
Abstract
 Add to MetaCart
(Show Context)
In order to obtain a formalism for the specification of true concurrency in reactive systems, we modify the µcalculus such that properties that are valid during the execution of an action can be expressed. The interpretation of this logic is based on transition systems that are used to model the STsemantics. We show that this logic and step equivalence have an incomparable expressive power. Furthermore, we show that the logic characterizes the STbisimulation equivalence for finite process algebra expressions that do not contain synchronization mechanisms.