Bisimulation equivalence is decidable for normed process algebra (extended abstract)

Yoram Hirshfeld, Mark Jerrum

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present a procedure for deciding whether two normed PA terms are bisimilar. The procedure is "elementary," having doubly exponential non-deterministic time complexity.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 26th International Colloquium, ICALP 1999, Proceedings
PublisherSpringer Verlag
Pages412-421
Number of pages10
ISBN (Print)3540662243, 9783540662242
DOIs
StatePublished - 1999
Event26th International Colloquium on Automata, Languages and Programming, ICALP 1999 - Prague, Czech Republic
Duration: 11 Jul 199915 Jul 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1644 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference26th International Colloquium on Automata, Languages and Programming, ICALP 1999
Country/TerritoryCzech Republic
CityPrague
Period11/07/9915/07/99

Fingerprint

Dive into the research topics of 'Bisimulation equivalence is decidable for normed process algebra (extended abstract)'. Together they form a unique fingerprint.

Cite this