Checking equivalences between concurrent systems of finite agents

Alexander Rabinovich*

*Corresponding author for this work

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

Abstract

Consider two synchronously communicating systems p and q over finite agents. Assume that one wants to check whether p ~ q for one of the commonly used equivalences. We show that this question is PSPACE hard for all equivalences which lie between strong bisimulation and trace equivalences. For some equivalences exponential lower and upper bounds are proven. We also show that this problem is NP hard and co-NP hard even for a class of very simple finite agents. Dataflow nets are the simplest systems of asynchronously communicating agents. Let ~ be an equivalence which lies between strong bisimulation and trace equivalences. We show that there is no algorithm for checking ~-equivalence between dataflow nets over finite state agents.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 19th International Colloquium, Proceedings
EditorsWerner Kuich
PublisherSpringer Verlag
Pages696-707
Number of pages12
ISBN (Print)9783540557197
DOIs
StatePublished - 1992
Externally publishedYes
Event19th International Colloquium on Automata, Languages, and Programming, ICALP 1992 - Wien, Austria
Duration: 13 Jul 199217 Jul 1992

Publication series

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

Conference

Conference19th International Colloquium on Automata, Languages, and Programming, ICALP 1992
Country/TerritoryAustria
CityWien
Period13/07/9217/07/92

Fingerprint

Dive into the research topics of 'Checking equivalences between concurrent systems of finite agents'. Together they form a unique fingerprint.

Cite this