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
Journal ArticleDOI

A Process Algebraic Approach to the Schedulability Analysisof Real-Time Systems

Hanêne Ben-Abdallah, +5 more
- 01 Nov 1998 - 
TL;DR: This paper describes an approach to the specification and schedulability analysis of real-time systems based on the timed process algebra ACSR-VP, which is an extension of ACSR with value-passing communication and dynamic priorities that is capable of specifying a variety of real time systems with different scheduling disciplines in a modular fashion.
Journal ArticleDOI

A tutorial on coinductive stream calculus and signal flow graphs

Jan Rutten
TL;DR: In this paper, an application of coinductive stream calculus to signal flow graphs is presented, which is based on Z-transforms (a discrete version of Laplace transforms) and transfer functions.
Journal ArticleDOI

The equational logic of fixed points

Stephen L. Bloom, +1 more
- 01 Jun 1997 - 
Book ChapterDOI

The Meaning of Negative Premises in Transition System Specifications

Roland N. Bol, +1 more
TL;DR: A criterion that should be satisfied by a TSS in order to be meaningful, i.e. to unequivocally define a transition relation is formulated and powerful techniques for proving this criterion are provided.
Book ChapterDOI

Compositionality in State Space Verification Methods

Antti Valmari
TL;DR: The concepts and ideas that are necessary for understanding computerised process-algebraic compositional verification are introduced and some advanced ways of using the basic techniques are described.
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.