Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
Antonín Kuča,Richard Mayr +1 more
TLDR
It is proved that weak bisimilarity is decidable in polynomial time between finite-state systems and several classes of infinite- state systems: context-free processes and normed basic parallel processes (normed BPP).About:
This article is published in Theoretical Computer Science.The article was published on 2002-01-06 and is currently open access. It has received 20 citations till now. The article focuses on the topics: Decidability & Bisimulation.read more
Citations
More filters
Roadmap of Infinite Results
TL;DR: The equivalence checking results for infinite state systems are summarized in this article and references to the relevant papers will be updated continuously according to the development in the area and the most recent version of this document is available from the web-pagehttp://www.brics.dk/~srba/roadmap.
Journal ArticleDOI
Equivalence-checking on infinite-state systems: Techniques and results
Antonín Kučera,Petr Jancar +1 more
TL;DR: A selection of recently developed and/or used techniques for equivalence-checking on infinite-state systems can be found in this article, with an up-to-date overview of existing results.
Journal ArticleDOI
Resumptions, Weak Bisimilarity and Big-Step Semantics for While with Interactive I/O: An Exercise in Mixed Induction-Coinduction
Keiko Nakata,Tarmo Uustalu +1 more
TL;DR: In this paper, the operational semantics of languages with interactive I/O through the glasses of constructive type theory are defined. But this work is restricted to the case of While, and it is not applicable to other languages.
Journal ArticleDOI
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
Antonín Kučera,Richard Mayr +1 more
TL;DR: This work presents a complete picture of the computational complexity of checking strong and weak semantic preorders/equivalences between pushdown processes and finite-state processes and study fixed-parameter tractability in two important input parameters.
Journal ArticleDOI
Resumptions, Weak Bisimilarity and Big-Step Semantics for While with Interactive I/O: An Exercise in Mixed Induction-Coinduction
Keiko Nakata,Tarmo Uustalu +1 more
TL;DR: Several big-step semantics for Whil e with interactive I/O are defined, based on resumptions and termination-sensitive weak bisimilarity, which require nesting inductive definitions in coinductive definitions, which is interesting both matically and from the point-of-view of implementation in a proof assistant.
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 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.
Journal ArticleDOI
Three partition refinement algorithms
Robert Paige,Robert E. Tarjan +1 more
TL;DR: This work presents improved partition refinement algorithms for three problems: lexicographic sorting, relational coarsest partition, and double lexical ordering that uses a new, efficient method for unmerging two sorted sets.
Book
Process algebra
J. C. M. Baeten,W. P. Weijland +1 more
TL;DR: A hybrid process algebra can be used for the specification, simulation, control and verification of embedded systems in combination with the environment, and for any dynamic system in general.