Results 1  10
of
31
On the Expressive Completeness of the Propositional MuCalculus With Respect to Monadic Second Order Logic
, 1996
"... . Monadic second order logic (MSOL) over transition systems is considered. It is shown that every formula of MSOL which does not distinguish between bisimilar models is equivalent to a formula of the propositional calculus. This expressive completeness result implies that every logic over tran ..."
Abstract

Cited by 65 (3 self)
 Add to MetaCart
. Monadic second order logic (MSOL) over transition systems is considered. It is shown that every formula of MSOL which does not distinguish between bisimilar models is equivalent to a formula of the propositional calculus. This expressive completeness result implies that every logic over transition systems invariant under bisimulation and translatable into MSOL can be also translated into the calculus. This gives a precise meaning to the statement that most propositional logics of programs can be translated into the calculus. 1 Introduction Transition systems are structures consisting of a nonempty set of states, a set of unary relations describing properties of states and a set of binary relations describing transitions between states. It was advocated by many authors [26, 3] that this kind of structures provide a good framework for describing behaviour of programs (or program schemes), or even more generally, engineering systems, provided their evolution in time is disc...
Deciding Properties for Message Sequence Charts
, 1998
"... Message sequence charts (MSC) are commonly used in designing communication systems. They allow describing the communication skeleton of a system and can be used for finding design errors. First, a specification formalism that is based on MSC graphs, combining finite message sequence charts, is p ..."
Abstract

Cited by 52 (9 self)
 Add to MetaCart
Message sequence charts (MSC) are commonly used in designing communication systems. They allow describing the communication skeleton of a system and can be used for finding design errors. First, a specification formalism that is based on MSC graphs, combining finite message sequence charts, is presented. We present then an automatic validation algorithm for systems described using the message sequence charts notation. The validation problem is tightly related to a natural languagetheoretic problem over semitraces (a generalization of Mazurkiewicz traces, which represent partially ordered executions). We show that a similar and natural decision problem is undecidable. 1
Compositional message sequence charts
 IN PROC. 7 TH INTL. CONFERENCE ON TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS (TACAS’01), VOLUME 2031 OF LECT. NOTES IN COMP. SCI
, 2001
"... Message sequence charts (MSCs) is a standard notation for describing the interaction between communicating objects. It is popular among the designers of communication protocols. MSCs enjoy both a visual and a textual representation. High level MSCs (HMSCs) allow specifying in nite scenarios and di ..."
Abstract

Cited by 42 (8 self)
 Add to MetaCart
Message sequence charts (MSCs) is a standard notation for describing the interaction between communicating objects. It is popular among the designers of communication protocols. MSCs enjoy both a visual and a textual representation. High level MSCs (HMSCs) allow specifying in nite scenarios and di erent choices. Speci cally, anHMSC consists of a graph, where each node is a nite MSC with matched send and receive events, and vice versa. In this paper we demonstrate a weakness of HMSCs, which disallows one to model certain interactions. We will show, by means of an example, that some simple nite state and simple communication protocol cannot be represented using HMSCs. We then propose an extension to the MSC standard, which allows HMSC nodes to include unmatched messages. The corresponding graph notation will be called HCMSC, which stands for High level Compositional Message Sequence Charts. With the extended framework, we provide an algorithm for automatically constructing an MSC representation for nite state asynchronous message passing protocols.
An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces
, 1997
"... A basic result concerning LTL, the propositional temporal logic of linear time, is that it is expressively complete; it is equal in expressive power to the first order theory of sequences. We present here a smooth extension of this result to the class of partial orders known as Mazurkiewicz traces. ..."
Abstract

Cited by 42 (5 self)
 Add to MetaCart
A basic result concerning LTL, the propositional temporal logic of linear time, is that it is expressively complete; it is equal in expressive power to the first order theory of sequences. We present here a smooth extension of this result to the class of partial orders known as Mazurkiewicz traces. These partial orders arise in a variety of contexts in concurrency theory and they provide the conceptual basis for many of the partial order reduction methods that have been developed in connection with LTLspecifications. We show that LTrL, our linear time temporal logic, is equal in expressive power to the first order theory of traces when interpreted over (finite and) infinite traces. This result fills a prominent gap in the existing logical theory of infinite traces. LTrL also constitutes a characterisation of the so called trace consistent (robust) LTLspecifications. These are specifications expressed as LTL formulas that do not distinguish between different linearisations of the same trace and hence are amenable to partial order reduction methods.
Locally Linear Time Temporal Logic
 In LICS '96
, 1996
"... We study linear time temporal logics of multiple agents, where the temporal modalities are local. These modalities not only refer to local nextinstants and local eventuality, but also global views of agents at any local instant, which are updated due to communication from other agents. Thus agentsa ..."
Abstract

Cited by 29 (6 self)
 Add to MetaCart
We study linear time temporal logics of multiple agents, where the temporal modalities are local. These modalities not only refer to local nextinstants and local eventuality, but also global views of agents at any local instant, which are updated due to communication from other agents. Thus agentsalso reason about the future, present and past of other agents in the system. The models for these logics are simple : runs of networks of synchronizing automata. Problems like gossipping in interconnection networks are naturally described in the logics proposed here. We present solutions to the satisfiability and model checking problems for these logics. Further, since formulas are insensitive to different interleavings of runs, partial order based verification methods become applicable for properties described in these logics. 1. Introduction 1 The Propositional Temporal Logic of Linear Time (PTL) has proved to be a successful logical tool for specifying and reasoning about the behaviou...
An Algorithmic Approach for Checking Closure Properties of omegaRegular Languages
 In Proceedings of CONCUR '96: 7th International Conference on Concurrency Theory
, 1995
"... In concurrency theory, there are several examples where the interleaved model of concurrency can distinguish between execution sequences which are not significantly different. One such example is sequences that differ from each other by stuttering, i. e., the number of times a state can adjacent ..."
Abstract

Cited by 25 (3 self)
 Add to MetaCart
In concurrency theory, there are several examples where the interleaved model of concurrency can distinguish between execution sequences which are not significantly different. One such example is sequences that differ from each other by stuttering, i. e., the number of times a state can adjacently repeat. Another example is executions that differ only by the ordering of independently executed events. Considering these sequences as different is semantically rather meaningless. Nevertheless, specification languages that are based on interleaving semantics, such as linear temporal logic (LTL), can distinguish between them. This situation has led to several attempts to define languages that cannot distinguish between such equivalent sequences. In this paper, we take a different approach to this problem: we develop algorithms for deciding if a property cannot distinguish between equivalent sequences, i. e., is closed under the equivalence relation. We focus on properties represented by regular languages, !regular languages, or propositional LTL formulae and show that for such properties there is a wide class of equivalence relations for which determining closure is decidable, in fact in PSPACE.
Difficult configurations  on the complexity of LTrL
, 1998
"... 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 conguration. The logic is shown to be nonelementary with the main reason for this complexity being the nesting of u ..."
Abstract

Cited by 21 (3 self)
 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 conguration. 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 EXPSPACEcomplete. 1 Introduction Innite words, which linear orders on events, are often used to model executions of systems. Innite traces, which are partial orders on events, are often used to model concurrent systems when we do not want to put some arbitrary ordering on actions occurring concurrently. A state of a system in the linear model is just a prex of an innite word; it represents the actions that have already happened. A state of a system in the trace model is a conguration, i.e., a nite downwards closed set of events that already happened. Temporal logics over traces come in t...
Efficient Decentralized Monitoring of Safety in Distributed Systems
 SLD Collaboration), Phys. Rev. D53
, 2004
"... We describe an efficient decentralized monitoring algorithm that monitors a distributed program's execution to check for violations of safety properties. The monitoring is based on formulae written in PTDTL, a variant of past time linear temporal logic that we define. PTDTL is suitable for express ..."
Abstract

Cited by 20 (3 self)
 Add to MetaCart
We describe an efficient decentralized monitoring algorithm that monitors a distributed program's execution to check for violations of safety properties. The monitoring is based on formulae written in PTDTL, a variant of past time linear temporal logic that we define. PTDTL is suitable for expressing temporal properties of distributed systems. Specifically, the formulae of PTDTL are relative to a particular process and are interpreted over a projection of the trace of global states that represents what that process is aware of. A formula relative to one process may refer to other processes' local states through remote expressions and remote formulae. In order to correctly evaluate remote expressions, we introduce the notion of KNOWLEDGEVECTOR and provide an algorithm which keeps a process aware of other processes' local states that can affect the validity of a monitored PTDTL formula. Both the logic and the monitoring algorithm are illustrated through a number of examples. Finally, we describe our implementation of the algorithm in a tool called DIANA.
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.
Pure future local temporal logics are expressively complete for Mazurkiewicz traces
 Conference version in LATIN 2004, LNCS 2976
"... Mazurkiewicz traces ⋆ ..."