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

Weighted Bisimulation in Linear Algebraic Form

Michele Boreale
TL;DR: It is shown that the largest bisimulation coincides with weighted language equivalence, can be computed by a geometrical version of partition refinement and that the corresponding quotient gives rise to the minimal weighted-language equivalence automaton.
Journal Article

A model for interaction of agents and environments

Alexander A. Letichevsky, +1 more
- 01 Jan 2000 - 
TL;DR: A new abstract model of interaction between agents and environments considered as objects of different types considered up to bisimilarity is introduced and a new type of agent equivalence – insertion equivalence is defined.
Journal ArticleDOI

Nested semantics over finite trees are equationally hard

Luca Aceto, +3 more
- 15 Jun 2004 - 
TL;DR: It is shown that none of these semantics affords finite (in)equational axiomatizations over BCCSP, a basic formalism to express finite process behaviour.

Model checking and theorem proving: a unified framework

Sergey Berezin, +1 more
TL;DR: This work provides a new unified framework that includes both model checking and theorem proving, and is designed for fast prototyping of tools or manual but computer-assisted testing of new verification methodologies, and implements this framework in a theorem prover-like environment.
Book ChapterDOI

Verifying a protocol using relativized bisimulation

Kim Guldstrand Larsen, +1 more
TL;DR: A compositional proof method in which a property P of a complete system is demonstrated by first decomposing the system, then demonstrating properties of the sysbsystems which are strong enough to entail property P for the complete system.
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.