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
Book ChapterDOI

Process Algebra with Backtracking

Jan A. Bergstra, +3 more
TL;DR: An extension of process algebra for modelling processes with backtracking is introduced in this paper, which is semantically based on processes that transform data because, in their view, backtracking can undoing of the effects caused by a process in some initial data-state if this process fails.
Journal Article

Lifting temporal proofs through abstractions

Kedar S. Namjoshi
- 01 Jan 2003 - 
TL;DR: This paper shows how to 'lift' a deductive proof that is generated for an abstract program back into the original program domain, relative to several types of abstraction relationships between the two programs, and develops simplifications of the lifting scheme for common types of abstractions.
Book ChapterDOI

Norm Functions for Probabilistic Bisimulations with Delays

Christel Baier, +1 more
TL;DR: Using a suitable modification of the prominent splitter/partitioning technique, polynomial-time algorithms are presented that constructs the quotient space of the (strict) normed bisimulation equivalence classes.
Journal ArticleDOI

Factorisation of finite state machines under strong and observational equivalences

Huajun Qin, +1 more
- 01 Jul 1991 - 
TL;DR: This paper uses a finite state machine (FSM) model consistent with CCS and study two factorisation problems:P |||P ∼Q andP || |P ≈Q, where ||| is a derived CCS composition operator, ∼ and ≈ represent strong and observational equivalences.
Journal ArticleDOI

Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations

Lijun Zhang, +3 more
- 27 Aug 2008 - 
TL;DR: In this paper, the authors presented a decision algorithm for strong and weak simulation over Markov chains, and for strong simulation over probabilistic automata, using parametric maximum flow techniques to amortize computations.
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.