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

Comparing logics for rewriting

Fabio Gadducci, +1 more
- 28 Aug 2002 - 
TL;DR: The aim of the paper is to analyze three proposals, namely rewriting logic, action calculi and tile logic, chosen among those formalisms designed for the description of rule-based systems, to find out a common layout where these logics can be recast.
Book ChapterDOI

The Tyft/Tyxt Format Reduces to Tree Rules

Wan Fokkink
TL;DR: In this paper, the authors show that the well-foundedness condition in the Congruence Theorem of [5] can be dropped for tyft/tyxt transition systems with negative premises and predicates.
Journal ArticleDOI

A domain equation for refinement of partial systems

Michael Huth, +2 more
- 01 Aug 2004 - 
TL;DR: It is shown that modal transition systems are, up to a saturation condition, exactly the mixed transition systems of Dams that meet a mix condition, and it is demonstrated that many frameworks of partial systems can be translated into the domain.
Book ChapterDOI

Covering indexes for XML queries: bisimulation - simulation = negation

Prakash Ramanan
TL;DR: The last two results show that disallowing negation in the queries could substantially reduce the size of the smallest covering index for BPQ covering indexes of XML documents.
Journal ArticleDOI

Characteristic Formulae for Timed Automata

Luca Aceto, +3 more
- 01 Nov 2000 - 
TL;DR: In this article, the authors present characteristic formula constructions in the real-time logic L v for several behavioural relations between states of timed automata, including timed (bi)similarity, timed ready simulation, faster-than bisimilarity and timed trace inclusion.
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.