Results 1  10
of
36
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 47 (5 self)
 Add to MetaCart
(Show Context)
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.
Logics for Specifying Concurrent Information Systems
 LOGICS FOR DATABASES AND INFORMATION SYSTEMS
, 1998
"... ..."
Difficult configurations – on the complexity of LTrL
 In ICALP’98  Automata, Languages and Programming, 25th International Colloquium, number 1443 in Lecture Notes in Computer Science
, 1998
"... ..."
Specifying Communication in Distributed Information Systems
 Acta Informatica
, 1998
"... . In this paper, we present two logics that allow for specifying distributed information systems, emphasizing communication among sites. The lowlevel logic D 0 offers features that are easy to implement but awkward to use for specification, while the highlevel logic D 1 offers convenient specifica ..."
Abstract

Cited by 16 (8 self)
 Add to MetaCart
(Show Context)
. In this paper, we present two logics that allow for specifying distributed information systems, emphasizing communication among sites. The lowlevel logic D 0 offers features that are easy to implement but awkward to use for specification, while the highlevel logic D 1 offers convenient specification features that are not easy to implement. We show that D 1 specifications may be automatically translated to D 0 in a sound and complete way. In order to prove soundness and completeness, we define our translation as a simple map of institutions. Our result may be useful for making implementation platforms like Corba easier accessible by providing highlevel planning and specification methods for communication. 1 Introduction Two logics are presented that allow for specifying distributed information systems, emphasizing communication among sites. The lowlevel logic D 0 offers features that are easy to implement but awkward to use for specification, while the highlevel logic D 1 offers...
Keeping Track of the Latest Gossip in a Distributed System
 DISTRIBUTED COMPUTING
, 1997
"... We tackle a natural problem from distributed computing, involving timestamps. Let P = fp 1 ; p 2 ; : : : ; p N g be a set of computing agents or processes which synchronize with each other from time to time and exchange information about themselves and others. The gossip problem is the following: W ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
We tackle a natural problem from distributed computing, involving timestamps. Let P = fp 1 ; p 2 ; : : : ; p N g be a set of computing agents or processes which synchronize with each other from time to time and exchange information about themselves and others. The gossip problem is the following: Whenever a set P ` P meets, the processes in P must decide amongst themselves which of them has the latest information, direct or indirect, about each agent p in the system. We propose an algorithm to solve this problem which is finitestate and local. Formally, this means that our algorithm can be implemented as an asynchronous automaton.
The MSO Theory of Connectedly Communicating Processes
"... Abstract. We identify a network of sequential processes that communicate by synchronizing frequently on common actions. More precisely, we demand that there is a bound k such that if the process p executes k steps without hearing from process q—directly or indirectly—then it will neverhearfromq agai ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We identify a network of sequential processes that communicate by synchronizing frequently on common actions. More precisely, we demand that there is a bound k such that if the process p executes k steps without hearing from process q—directly or indirectly—then it will neverhearfromq again. The noninterleaved branching time behavior of a system of connectedly communicating processes (CCP) is given by its event structure unfolding. We show that the monadic second order (MSO) theory of the event structure unfolding of every CCP is decidable. Using this result, we also show that an associated distributed controller synthesis problem is decidable for linear time specifications that do not discriminate between two different linearizations of the same partially ordered execution.
Temporal Logic of Causal Knowledge
 Proc. of WoLLiC '98
, 1998
"... . Temporal logic of causal knowledge over general partially ordered structures is defined. The definition of knowledge captures the change of state due to action executions. The structures are a variant of flow event structures including prime event structures and branching processes of Petri Ne ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
(Show Context)
. Temporal logic of causal knowledge over general partially ordered structures is defined. The definition of knowledge captures the change of state due to action executions. The structures are a variant of flow event structures including prime event structures and branching processes of Petri Nets. Modalities corresponding to the causality, independency, and indistinguishability relations are used. Formulas are interpreted over local state occurrences. The logic is proved to be decidable and a complete axiomatization is provided. Keywords: multiagent systems, knowledge, temporal logic, causality, partially ordered sets. 1 Introduction Reasoning about knowledge is one of the fundamental problems in multiagent systems. Usually, dynamic global state spaces partitioned w.r.t. the agents' information are considered [3]. In the theory of distributed systems, knowledge formulas are interpreted over infinite linear or branching runs of the systems [4, 5, 3, 9, 15, 16]. It is clear ...
Petri Nets, Traces, and Local Model Checking
 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology, Lecture Notes in Computer Science 936, SpringerVerlag
, 1995
"... It has been observed that the behavioural view of concurrent systems that all possible sequences of actions are relevant is too generous; Not all sequences should be considered as likely behaviours. By taking progress fairness assumptions into account one obtains a more realistic behavioural view of ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
It has been observed that the behavioural view of concurrent systems that all possible sequences of actions are relevant is too generous; Not all sequences should be considered as likely behaviours. By taking progress fairness assumptions into account one obtains a more realistic behavioural view of the systems. In this paper we consider the problem of performing model checking relative to this behavioural view. We present a CTLlike logic which is interpreted over the model of concurrent systems labeled 1safe nets. It turns out that Mazurkiewicz trace theory provides a useful setting in which the progress fairness assumptions can be formalized in a natural way. We provide the first, to our knowledge, set of sound and complete tableau rules for a CTLlike logic interpreted under progress fairness assumptions. keywords: fair progress, labeled 1safe nets, local model checking, maximal traces, partial orders, inevitability 1 Introduction Recently attention has focused on behavioural v...
Deciding Global PartialOrder Properties
, 1998
"... Model checking of asynchronous systems is traditionally based on the interleaving model, where an execution is modeled by a total order between atomic events. Recently, the use of partial order semantics, representing the causal order between events, is becoming popular. This paper considers the mod ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Model checking of asynchronous systems is traditionally based on the interleaving model, where an execution is modeled by a total order between atomic events. Recently, the use of partial order semantics, representing the causal order between events, is becoming popular. This paper considers the model checking problem for partialorder temporal logics. Solutions to this problem exist for partial order logics over local states. For the more general global logics that are interpreted over global states, only undecidability results have been proved. In this paper, we present a decision procedure for a partial order temporal logic over global states. We also sharpen the undecidability results by showing that a single until operator is sufficient for undecidability.
Axiomatizations of Temporal Logics on Trace Systems
 Information Processing Letters 43
, 1996
"... Partial order temporal logics interpreted on trace systems have been shown not to have finitary complete axiomatizations due to the fact that the complexity of their decidability problem is in \Pi 1 1 . This paper gives infinitary complete proof systems for several temporal logics on trace systems ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Partial order temporal logics interpreted on trace systems have been shown not to have finitary complete axiomatizations due to the fact that the complexity of their decidability problem is in \Pi 1 1 . This paper gives infinitary complete proof systems for several temporal logics on trace systems e.g. Computation Tree Logic with past operators and an essential subset of Interleaving Set Temporal Logic. 1 Introduction Partial order temporal logics are becoming an important formalism used for specification and verification of concurrent systems [KP87, PP94, Pe90, Pe91, PKP91, Re89, Si90]. These logics are more expressive than linear and branching time temporal logics. They allow for expressing and proving important properties of concurrent systems as serializability of database transactions [PP94, PKP91], inevitability under concurrency fairness assumption [Pe90, Pe93a], causal successor [Re89], layering of a program [PP94], snapshots or the concurrency of program segments [PP94, Pe93...