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

Distributed bisimulations

Ilaria Castellani, +1 more
- 01 Oct 1989 - 
TL;DR: A new equivalence between concurrent processes is proposed, which generalizes the well-known bisimulation equivalence to take into account the distributed nature of processes and is a noninterleaving semantic theory.
Journal ArticleDOI

Approximating and computing behavioural distances in probabilistic transition systems

Franck van Breugel, +1 more
- 21 Aug 2006 - 
TL;DR: A polynomial-time algorithm is given, based on linear programming, to calculate the distances between states up to a prescribed degree of accuracy.
Journal ArticleDOI

Bisimulations for Fuzzy-Transition Systems

Yongzhi Cao, +2 more
- 01 Jun 2011 - 
TL;DR: This paper considers bisimulation for general fuzzy systems, which may be infinite state or infinite event, by modeling them as fuzzy-transition systems (FTSs), and characterize it in three ways by enumerating whole transitions, comparing individual transitions, and using a monotonic function.
Journal ArticleDOI

A Theory of Processes with Durational Actions

Roberto Gorrieri, +2 more
TL;DR: A comparison with other equivalences is provided and it is shown that performance equivalence is strictly finer than step bisimulation equivalence and strictly coarser than partial ordering bisimulations equivalence.
Journal ArticleDOI

A model-checking verification environment for mobile processes

Gian Luigi Ferrari, +3 more
- 01 Oct 2003 - 
TL;DR: A semantic-based environment for reasoning about the behavior of mobile systems using a novel automata-like model that allows finite-state verification of systems specified in the π-calculus is presented.
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.