The Library

Concurrency and automata on infinite sequences

Tools

Park, D. M. R. (1981) Concurrency and automata on infinite sequences. Coventry, UK: Department of Computer Science..

Full text not available from this repository.

Abstract

The paper is concerned with ways in which fair concurrency can be modeled using notations for- omega regular languages - languages containing infinite sequences, whose recognizers a.re 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. fix point operators. The class of $\omega $-regular. languages is closed under a fair concurrency operator. A general method for proving/deciding equivalences between such languages is obtained, derived from Milner'S notion of "simulation".

Item Type: Report
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science > Computer Science
Publisher: Department of Computer Science
Place of Publication: Coventry, UK
Date: May 1981
Number of Pages: 18
Identification Number: CS-RR-035
Institution: University of Warwick
Theses Department: Department of Computer Science
Status: Not Peer Reviewed
Publication Status: Published
Access rights to Published version: Open Access
Related URLs:
URI: http://wrap.warwick.ac.uk/id/eprint/47224

Request changes to a record

Actions (login required)

View Item View Item