Pushdown automata, multiset automata, and Petri nets
Yoram Hirshfeld,Faron Moller +1 more
TLDR
This paper provides a proof of an earlier conjecture by Moller: that multiset automata form a proper subset of Petri nets, which contrasts with the result of Caucal for the analogous question in the sequential case where the hierarchy collapses.About:
This article is published in Theoretical Computer Science.The article was published on 2001-04-06 and is currently open access. It has received 21 citations till now. The article focuses on the topics: Automata theory & Nested word.read more
Citations
More filters
Journal ArticleDOI
Analytic and Algorithmic Solution of Random Satisfiability Problems
TL;DR: A class of optimization algorithms that can deal with the proliferation of metastable states are introduced; one such algorithm has been tested successfully on the largest existing benchmark of K-satisfiability.
Journal ArticleDOI
The Cavity Method at Zero Temperature
Marc Mézard,Giorgio Parisi +1 more
TL;DR: In this article, the authors use the cavity method in the case of spin glass on a lattice with a local tree-like structure, which is the proper generalization of the usual Bethe lattice to frustrated problems.
Posted Content
The cavity method at zero temperature
Marc Mézard,Giorgio Parisi +1 more
TL;DR: In this paper, the use of the cavity method directly at zero temperature, in the case of the spin glass on a Bethe lattice, has been discussed in the formalism equivalent to "one step replica symmetry breaking".
From computability to executability : a process-theoretic view on automata theory
TL;DR: This thesis investigates the integration of the two theories of automata and formal language theory, exposing the differences and similarities between them and presents the reactive Turing machine, a classical Turing machine augmented with capabilities for interaction.
Book ChapterDOI
Extended Process Rewrite Systems: Expressiveness and Reachability
TL;DR: It is shown that the class of Petri nets is less expressive up to bisimulation equivalence than theclass of PA processes extended with a finite state control unit.
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Book
Communication and Concurrency
TL;DR: This chapter discusses Bisimulation and Observation Equivalence as a Modelling Communication, a Programming Language, and its application to Equational laws.
Book
A calculus of communicating systems
TL;DR: A case study in synchronization and proof techniques, and some proofs about data structures in value-communication as a model of CCS 2.0.
Book ChapterDOI
Concurrency and Automata on Infinite Sequences
TL;DR: 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.
Book
An Introduction to Automata Theory
TL;DR: Great Aunt Eugenia and other automata Sundry machines Implementing finite automata Implementation and realization Behavioural equivalence, SP partitions and reduced machines