scispace - formally typeset
Open AccessBook ChapterDOI

Concurrency and Automata on Infinite Sequences

David Park
- 23 Mar 1981 - 
- pp 167-183
Reads0
Chats0
TLDR
A general method for proving/deciding equivalences between omega-regular languages, whose recognizers are modified forms of Buchi or Muller-McNaughton automata, derived from Milner's notion of “simulation” is obtained.
About: 
This article is published in Theoretical Computer Science.The article was published on 1981-03-23 and is currently open access. It has received 2256 citations till now. The article focuses on the topics: Abstract family of languages & Cone (formal languages).

read more

Citations
More filters
Proceedings ArticleDOI

From sequential programs to multi-tier applications by program transformation

Matthias Neubauer, +1 more
TL;DR: A multi-tier calculus and a splitting transformation are proposed that extracts one process per tier from the sequential program such that their concurrent execution behaves like the original program.
Journal Article

Reachability analysis of multi-affine systems

Marius Kloetzer, +1 more
- 01 Jan 2006 - 
TL;DR: The methodology promises to be easily extendable to rectangular hybrid automata with multi-affine vector fields and is expected to find important applications in analysis of biological networks and robot control.
Journal ArticleDOI

Transition systems, link graphs and Petri nets

James J. Leifer, +1 more
- 01 Dec 2006 - 
TL;DR: A labelled transition system is derived for condition-event nets, corresponding to a natural notion of observable actions in Petri-net theory, and yields a congruential bisimilarity coinciding with one derived directly from the observable actions.
Journal ArticleDOI

Notes on the methodology of CCS and CSP

R. J. van Glabbeek
- 15 May 1997 - 
TL;DR: In this paper, the methodology of some theories of concurrency (mainly CCS and CSP) is analysed, focusing on the following topics: the representation of processes, the identification issue, and the treatment of nondeterminism, communication, recursion, abstraction, divergence and deadlock behaviour.
Journal ArticleDOI

Exemplar queries: a new way of searching

Davide Mottin, +3 more
TL;DR: This work introduces a novel query paradigm that considers a user query as an example of the data in which the user is interested and provides a formal specification of their semantics, which are fundamentally different from notions like queries by example, approximate queries and related queries.
References
More filters
Journal ArticleDOI

Finite automata and their decision problems

Michael O. Rabin, +1 more
- 01 Apr 1959 - 
TL;DR: 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.
Book ChapterDOI

Weak Second-Order Arithmetic and Finite Automata

J. Richakd Büchi
- 01 Jan 1960 - 
TL;DR: The formalism of regular expressions was introduced by S. C. Kleene to obtain the following basic theorems.
Journal ArticleDOI

Derivatives of Regular Expressions

Janusz A. Brzozowski
- 01 Oct 1964 - 
TL;DR: 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.
Proceedings Article

An algebraic definition of simulation between programs

Robin Milner
TL;DR: 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.
Journal ArticleDOI

Testing and generating infinite sequences by a finite automaton

Robert McNaughton
- 01 Oct 1966 - 
TL;DR: Two apparently divergent areas of inquiry should give rise to the same problem, namely, that of describing the infinite history of finite automata, and it is this problem to which the remainder of this paper will address itself.
Frequently Asked Questions (1)
Q1. What are the contributions in this paper?

The paper is concerned with ways in which fair concurrency can be modeIled rr, sing notations for omega-: :egu-lar languages languages containing infinite seguences, whose recognizers a. re modified forms of Biichi or MuLler-McNaughton automata.