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

An implementation of an efficient algorithm for bisimulation equivalence

J.-C. Fernandez
- 01 Apr 1990 - 
TL;DR: This paper describes how the Paige-Tarjan algorithm of complexity O(m log n) has been adapted to minimize labeled transition systems modulo bisimulation equivalence and is used in Aldebaran, a tool for the verification of concurrent systems.
Journal ArticleDOI

Controlling a Class of Nonlinear Systems on Rectangles

Calin Belta, +1 more
- 13 Nov 2006 - 
TL;DR: This work derives necessary and sufficient conditions for the existence of a multiaffine feedback control law keeping the system in a rectangular invariant and shows the application of its results to the problem of controlling the angular velocity of an aircraft with gas jet actuators.
Book ChapterDOI

The Join Calculus: A Language for Distributed Mobile Programming

Cédric Fournet, +1 more
TL;DR: The join calculus as mentioned in this paper is a language that models distributed and mobile programming, characterized by an explicit notion of locality, a strict adherence to local synchronization, and a direct embedding of the ML programming language.
Book ChapterDOI

Model Checking Partial State Spaces with 3-Valued Temporal Logics

Glenn Bruns, +1 more
TL;DR: In this article, a 3-valued interpretation of modal logic formulas on partial Kripke structures is given, where the third truth value ⊥ means "unknown whether true or false".
Posted Content

Approximately bisimilar symbolic models for nonlinear control systems

Giordano Pola, +2 more
- 02 Jun 2007 - 
TL;DR: In this article, it was shown that every incrementally globally asymptotically stable nonlinear control system is approximately equivalent (bisimilar) to a symbolic model, where the approximation error is a design parameter in the symbolic model and can be rendered as small as desired.
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.