[moca] Decidability of semantics

[Joachim Parrow <joachim@xxxxxxxx>]

Dear Moca, and Frits (who may have done related work but may not be on 
Moca),

Has it been determined exactly under what circumstances it is decidable 
what transitions an agent has? In "Bisimulation can't be traced" (POPL 
1988) Bloom, Istrail and Meyer make a remark that in the presence of 
unguarded recursion this is undecidable and I believe this is kind of 
folklore, but I have not actually seen a proof or a closer investigation.

A related question is decidability of structural congruence - is this 
problem still open?

Joachim Parrow


 
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
The "models for mobility" mailing list     mailto:moca@xxxxxxxxxxxxxxx
http://www-sop.inria.fr/mimosa/personnel/Davide.Sangiorgi/moca.html