# Concurrency and Automata on Infinite Sequences

@inproceedings{Park1981ConcurrencyAA,
title={Concurrency and Automata on Infinite Sequences},
author={David Michael Ritchie Park},
booktitle={Theoretical Computer Science},
year={1981}
}
• D. Park
• Published in Theoretical Computer Science 23 March 1981
• Computer Science
The paper is concerned with ways in which fair concurrency can be modelled using notations for omega-regular languages — languages containing infinite sequences, whose recognizers are modified forms of Buchi or Muller-McNaughton automata. There are characterization of these languages in terms of recursion equation sets which involve both minimal and maximal fixpoint operators. The class of ω-regular languages is closed under a fair concurrency operator. A general method for proving/deciding…
2,290 Citations
Ordinal Processes in Comparative Concurrency Semantics
The study of Ordinal Processes of Klop provides a wide family of simple counter-examples to show that two equivalences do not coincide, and the considered semantics are induced by temporal logics CTL, CTL* and Lμ.
Fixed Points of Büchi Automata
• M. Dam
• Mathematics, Computer Science
FSTTCS
• 1992
A new and direct proof of the equivalence between the linear time μ-calculus νTL and Buchi automata is given which in contrast to previously known constructions is both elementary and compositional.
Verification on Infinite Structures
• Computer Science
Handbook of Process Algebra
• 2001
A regular viewpoint on processes and algebra
While different algebraic structures have been proposed for the treatment of concurrency, finding solutions for equations over these structures needs to be worked on further. This article is a survey
A Taxonomy of Infinite State Processes
• F. Moller
• Computer Science
Electron. Notes Theor. Comput. Sci.
• 1998
Acceptance Automata: A Framework for Specifying and Verifying TCSP Parallel Systems
• Computer Science
PARLE
• 1991
It is shown how parallel composition and hiding can be defined for labelled transition systems in a way consistent with the TCSP model and a notion of canonical automaton is presented.
A coalgebraic take on regular and $ω$-regular behaviours
• Tomasz Brengos
• Computer Science, Mathematics
Log. Methods Comput. Sci.
• 2021
A general coalgebraic setting in which finite and infinite behaviour is defined with Buchi acceptance condition for systems whose type is a monad and coal algebraic Kleene-type theorems for ($\omega$-) regular input are presented.
A Taxonomy of Innnite State Processes
This tutorial paper considers various classes of automata generated by simple rewrite transition systems, and provides natural deenitions for commutative (parallel) context-free automata, multiset (Parallel, or random access, push-down) Automata, and Petri nets.
Automata, tableaus and a reduction theorem for fixpoint calculi in arbitrary complete lattices
• David Janin
• Computer Science
Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science
• 1997
It is shown that any closedfixpoint expression is equivalent to a fixpoint expression built without the meet symbol /spl Lambda/, which generalizes Muller and Schupp's simulation theorem for alternating automata on the binary tree.

## References

SHOWING 1-10 OF 14 REFERENCES
Finite Automata and Their Decision Problems
• Computer Science
IBM J. Res. Dev.
• 1959
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.
Infinite sequences and finite machines
A regular set is a set of possible state sequences of an inputless, nondeterministic machine that may either terminate in some equilibrium condition, or else the machine may pass from one state to another without ever reaching equ~librium.
An Algebraic Definition of Simulation Between Programs
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.
Two Complete Axiom Systems for the Algebra of Regular Events
Two formal systems for the algebraic transformation of regular expressions are developed, one based upon the uniqueness of the solution of certain regular expression equations, and the other based upon some facts concerning the representation theory of regular events.
Derivatives of Regular Expressions
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.
On the Semantics of Fair Parallelism
• D. Park
• Computer Science
Abstract Software Specifications
• 1979
A sequence such as x := O; y := 1; (x := 1 par (while x=0 do y := y+1)) should be guaranteed to terminate in whatever context it is executed.
A Procedure for Checking Equality of Regular Expressions
A simple “mechanical” procedure is described for checking equality of regular expressions, based on the work of A. Salomaa, which uses derivatives ofregular expressions and transition graphs to generate a finite set of left-linear equations.
Weak Second‐Order Arithmetic and Finite Automata
The formalism of regular expressions was introduced by S. C. Kleene [6] to obtain the following basic theorems.