scispace - formally typeset
Open AccessBook ChapterDOI

Concurrency and Automata on Infinite Sequences

David Park
- 23 Mar 1981 - 
- pp 167-183
Reads0
Chats0
TLDR
A general method for proving/deciding equivalences between omega-regular languages, whose recognizers are modified forms of Buchi or Muller-McNaughton automata, derived from Milner's notion of “simulation” is obtained.
About: 
This article is published in Theoretical Computer Science.The article was published on 1981-03-23 and is currently open access. It has received 2256 citations till now. The article focuses on the topics: Abstract family of languages & Cone (formal languages).

read more

Citations
More filters
BookDOI

Formal Description Techniques IX

Reinhard Gotzhein, +1 more
TL;DR: It is in the framework of the ATM Forum view that the Video on Demand scenarios are presented in details and the problem of the jitter on the MPEG TS packets, jitter which jeopardizes the clock synchronisation is discussed.
Book ChapterDOI

Compositional Verification in Action

Hubert Garavel, +2 more
TL;DR: This article highlights the seminal results of Graf & Steffen and proposes a survey of compositional verification techniques that exploit (or not) these results.
Book ChapterDOI

A Completeness Theorem fro Nondeterministic Kleene Algebras

Rocco De Nicola, +1 more
TL;DR: The main result is that an algebra obtained from a suitable category of labelled trees plays the same role as the algebra of regular events.
Journal Article

The Expressive Power of Implicit Specifications

Kim Guldstrand Larsen
- 01 Jan 1991 - 
TL;DR: In this paper, the expressive power of implicit specifications of concurrent systems is investigated in the context of CCS contexts, and it is shown that when the environment is modeled as a CCS context and the implicit specifications are regular, their expressive power is the same and identical to that of Hennessy-Milner logic extended with (maximal) recursion.
Proceedings ArticleDOI

Computing Probabilistic Bisimilarity Distances via Policy Iteration

Qiyi Tang, +1 more
TL;DR: A modification of a basic version of an algorithm to compute the probabilistic bisimilarity distances for a labelled Markov chain is shown to be the policy iteration algorithm applied to the corresponding simple stochastic game.
References
More filters
Journal ArticleDOI

Finite automata and their decision problems

Michael O. Rabin, +1 more
- 01 Apr 1959 - 
TL;DR: Finite automata are considered as instruments for classifying finite tapes as well as generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined.
Book ChapterDOI

Weak Second-Order Arithmetic and Finite Automata

J. Richakd Büchi
- 01 Jan 1960 - 
TL;DR: The formalism of regular expressions was introduced by S. C. Kleene to obtain the following basic theorems.
Journal ArticleDOI

Derivatives of Regular Expressions

Janusz A. Brzozowski
- 01 Oct 1964 - 
TL;DR: In this paper the notion of a derivative of a regular expression is introduced atld the properties of derivatives are discussed and this leads, in a very natural way, to the construction of a state diagram from a regularexpression containing any number of logical operators.
Proceedings Article

An algebraic definition of simulation between programs

Robin Milner
TL;DR: A technique is given and illustrated for proving simulation and equivalence of programs; there is an analogy with Floyd''s technique for proving correctness of programs.
Journal ArticleDOI

Testing and generating infinite sequences by a finite automaton

Robert McNaughton
- 01 Oct 1966 - 
TL;DR: Two apparently divergent areas of inquiry should give rise to the same problem, namely, that of describing the infinite history of finite automata, and it is this problem to which the remainder of this paper will address itself.
Frequently Asked Questions (1)
Q1. What are the contributions in this paper?

The paper is concerned with ways in which fair concurrency can be modeIled rr, sing notations for omega-: :egu-lar languages languages containing infinite seguences, whose recognizers a. re modified forms of Biichi or MuLler-McNaughton automata.