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}
}
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 B~chi or Muller-McNaughton automata. There are charecterization of these languages in terms of recursion equation sets which involve both minimal and maximal… CONTINUE READING