par Devillers, Raymond
Editeur scientifique Best, Eike
Référence (May 1991: Goslar, Germany), 3rd Workshop on Concurrency and Compositionality, GMD-Studien Nr. 191, Hildesheimer Informatik-Berichte, Vol. 6, page (80-82)
Publication Publié, 1991-05
Publication dans des actes
Résumé : A simpler characterization is given for the maximality preserving bisimulation between labelled place/transition nets. The theory is extended to memoryless refinements and some preliminary thoughts are presented for selfconcurrent systems; the full refinement problem is then presented, and the case of interleaving semantics is considered.