Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Concurrency and automata on infinite sequences

Tools
- Tools
+ 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

Request Changes to record.

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
Dates:
DateEvent
May 1981["eprint_fieldopt_dates_date_type_available" not defined]
Number: Number 35
Number of Pages: 18
DOI: CS-RR-035
Institution: University of Warwick
Theses Department: Department of Computer Science
Status: Not Peer Reviewed
Publication Status: Unpublished
Publisher Statement: D.M.R. Park, Concurrency and Automata on Infinite Sequences, Proceedings of the 5th GI Conference on Theoretical Computer Science, Lecture Notes in Computer Science 104, Springer-Verlag, Berlin (1981)
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.

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us