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
Journal ArticleDOI

Concurrent transition systems

Eugene W. Stark
- 01 May 1989 - 
TL;DR: Using the definition of computations as ideals, a natural notion of observable equivalence of machines is defined, and it is shown that it is the largest congruence, respecting parallel product and feedback, that does not relate two machines with distinct input/output relations.
Book ChapterDOI

CoVaC: Compiler Validation by Program Analysis of the Cross-Product

Anna Zaks, +1 more
TL;DR: A deductive framework for proving program equivalence and its application to automatic verification of transformations performed by optimizing compilers, which accommodates absence of compiler annotations and handles most of the classical intraprocedural optimizations.
Journal ArticleDOI

Termination, deadlock, and divergence

Luca Aceto, +1 more
- 02 Jan 1992 - 
TL;DR: A process algebra that incorporates explicit representations of successful termination, deadlock, and divergence is introduced and its semantic theory is analyzed and it is shown that they agree.

Initial algebra and final coalgebra semantics for concurrency

Jan Rutten, +1 more
TL;DR: In this paper, it is shown how to derive initial algebra semantics from final coalgebra semantics, using the initiality and finality to ensure their equality, and many facts about congruences (on algebras) and (generalized) bisimulations (on coalgebra) are shown to be dual as well.
Book ChapterDOI

The Beginning of Model Checking: A Personal Perspective

E. Allen Emerson
TL;DR: Model checking provides an automated method for verifying concurrent systems using an efficient and flexible graph-theoretic reachability algorithm based on the small model theorem for temporal logic.
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.