The Library

Concurrency and automata on infinite sequences

Tools

Park, David (1981) Concurrency and automata on infinite sequences. University of Warwick. Department of Computer Science. (Theory of Computation Report). (Unpublished)

[img]
Preview
 Text
WRAP_Park_cs-rr-035.pdf - Published Version
Download (1157Kb) | Preview

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 ω-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
Library of Congress Subject Headings (LCSH): Computer multitasking, Machine theory
Series Name: Theory of Computation Report
Publisher: University of Warwick. Department of Computer Science
Official Date: May 1981
Number: Number 35
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: Unpublished
Access rights to Published version: Open Access
Version or Related Resource: Park, D.M.R. (1981). Concurrency and automata on infinite sequences. Proceedings of the 5th GI Conference on Theoretical Computer Science, Lecture Notes in Computer Science, 104, Berlin: Springer-Verlag.
URI: http://wrap.warwick.ac.uk/id/eprint/47224

Request changes or add full text files to a record

Actions (login required)

View Item View Item

Document Downloads

More statistics for this item...