TY - GEN

T1 - Checking equivalences between concurrent systems of finite agents

AU - Rabinovich, Alexander

N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1992.

PY - 1992

Y1 - 1992

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0012674520&partnerID=8YFLogxK

U2 - 10.1007/3-540-55719-9_115

DO - 10.1007/3-540-55719-9_115

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0012674520

SN - 9783540557197

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 696

EP - 707

BT - Automata, Languages and Programming - 19th International Colloquium, Proceedings

A2 - Kuich, Werner

PB - Springer Verlag

T2 - 19th International Colloquium on Automata, Languages, and Programming, ICALP 1992

Y2 - 13 July 1992 through 17 July 1992

ER -