Results 1  10
of
13
Logical Definability on Infinite Traces
 Theoretical Computer Science
, 1993
"... The main results of the present paper are the equivalence of definability by monadic secondorder logic and recognizability for real trace languages, and that firstorder definable, starfree, and aperiodic real trace languages form the same class of languages. This generalizes results on infinite w ..."
Abstract

Cited by 31 (4 self)
 Add to MetaCart
The main results of the present paper are the equivalence of definability by monadic secondorder logic and recognizability for real trace languages, and that firstorder definable, starfree, and aperiodic real trace languages form the same class of languages. This generalizes results on infinite words and on finite traces to infinite traces. It closes an important gap in the different characterizations of recognizable languages of infinite traces. 1 Introduction In the late 70's, A. Mazurkiewicz introduced the notion of trace as a suitable mathematical model for concurrent systems [16] (for surveys on this topic see also [1, 6, 10, 17]). In this framework, a concurrent system is seen as a set \Sigma of atomic actions together with a fixed irreflexive and symmetric independence relation I ` \Sigma \Theta \Sigma. The relation I specifies pairs of actions which can be carried out in parallel. It generates an equivalence relation on the set of sequential observations of the system. As ...
Regular Trace Event Structures
, 1996
"... We propose trace event structures as a starting point for constructing effective branching time temporal logics in a noninterleaved setting. ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We propose trace event structures as a starting point for constructing effective branching time temporal logics in a noninterleaved setting.
Muller MessagePassing Automata and Logics
"... Abstract. We study nonterminating messagepassing automata whose behavior is described by infinite message sequence charts. As a first result, we show that Muller, Büchi, and terminationdetecting Muller acceptance are equivalent for these devices. To describe the expressive power of these automata, ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. We study nonterminating messagepassing automata whose behavior is described by infinite message sequence charts. As a first result, we show that Muller, Büchi, and terminationdetecting Muller acceptance are equivalent for these devices. To describe the expressive power of these automata, we give a logical characterization. More precisely, we show that they have the same expressive power as the existential fragment of a monadic secondorder logic featuring a firstorder quantifier to express that there are infinitely many elements satisfying some property. Our result is based on a new extension of the classical EhrenfeuchtFraïssé game to cope with infinite structures and the new firstorder quantifier. 1
AssumptionCommitment in Automata
 Proc FST & TCS 17, LNCS 1346
, 1997
"... In the study of distributed systems, the assumption  commitment framework is crucial for compositional specification of processes. The idea is that we reason about each process separately, making suitable assumptions about other processes in the system. Symmetrically, each process commits to certai ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In the study of distributed systems, the assumption  commitment framework is crucial for compositional specification of processes. The idea is that we reason about each process separately, making suitable assumptions about other processes in the system. Symmetrically, each process commits to certain actions which the other processes can rely on. We study such a framework from an automatatheoretic viewpoint. We present systems of finite state automata which make assumptions about the behaviour of other automata and make commitments about their own behaviour. We characterize the languages accepted by these systems to be the regular trace languages (of Mazurkiewicz) over an associated independence alphabet, and present a syntactic characterization of these languages using toplevel parallelism. The results smoothly generalize for automata over infinite words as well. 1 Introduction A distributed system usually consists of a finite number of processes, which proceed asynchronously and p...
Determinizing Asynchronous Automata on Infinite Inputs
 APPEARS IN THIAGARAJAN, EDITOR, FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE: 15TH CONFERENCE, FST&TCS '95 PROCEEDINGS, LNCS 1026
, 1995
"... Asynchronous automata are a natural distributed machine model for recognizing trace languageslanguages defined over an alphabet equipped with an independence relation. To handle ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Asynchronous automata are a natural distributed machine model for recognizing trace languageslanguages defined over an alphabet equipped with an independence relation. To handle
On the complementation of asynchronous cellular Büchi automata
 Theoretical Computer Science
, 1996
"... We present direct subset automata constructions for asynchronous (asynchronous cellular, resp.) automata. This provides a solution to the problem of direct determinization for automata with distributed control for languages of finite traces. We use the subset automaton construction and apply Kla ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present direct subset automata constructions for asynchronous (asynchronous cellular, resp.) automata. This provides a solution to the problem of direct determinization for automata with distributed control for languages of finite traces. We use the subset automaton construction and apply Klarlund's progress measure technique in order to complement nondeterministic asynchronous cellular Buchi automata for infinite traces.
A Hierarchy of Partial Order Temporal Properties
 In Proc. Temporal Logic, LNCS
, 1994
"... We propose a classification of partial order temporal properties into a hierarchy, which is a generalization of the safetyprogress hierarchy of Chang, Manna and Pnueli. The classes of the hierarchy are characterized through three views: languagetheoretic, topological and temporal. Instead of the d ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We propose a classification of partial order temporal properties into a hierarchy, which is a generalization of the safetyprogress hierarchy of Chang, Manna and Pnueli. The classes of the hierarchy are characterized through three views: languagetheoretic, topological and temporal. Instead of the domain of strings, we take the domain of Mazurkiewicz traces as a basis for our considerations. For the languagetheoretic view, we propose operations on trace languages which define the four main classes of properties: safety, guarantee, persistence and response. These four classes are shown to correspond precisely to the two lower levels of the Borel hierarchy of the Scott topology of the domain of traces relativized to the infinite traces. In addition, a syntactic characterization of the classes is provided in terms of a sublogic of the Generalized Interleaving Set Temporal Logic GISTL (an extension of ISTL). 1 Introduction Recently, Chang, Manna and Pnueli [CMP93] proposed a classificati...
Distributed Interval Automata: A Subclass of Timed Automata
, 1998
"... We identify a subclass of timed automata and develop its theory. These automata, called distributed interval automata, consist of a network of timed agents. The key restriction is that there is just one clock for each agent and the way the clocks are read and reset is determined by the distribution ..."
Abstract
 Add to MetaCart
We identify a subclass of timed automata and develop its theory. These automata, called distributed interval automata, consist of a network of timed agents. The key restriction is that there is just one clock for each agent and the way the clocks are read and reset is determined by the distribution of shared actions across the agents. We show that the resulting automata admit a clean theory in both logical and language theoretic terms. We also establish decidability of the timed language inclusion and reachability problems for a related class of hybrid systems. It turns out that the study of distributed interval automata can exploit the rich theory of partial orders known as Mazurkiewicz traces. A likely consequence is that the partial order reduction techniques available in the untimed case can be applied to the verification tasks associated with our automata. Indeed this is the case with the recently proposed technique due to Bengtsson et. al. [BJLW98].