par Best, Eike ;Devillers, Raymond ;Kiehn, Astrid;Pomello, Lucia
Référence Acta informatica, 28, 3, page (231-264)
Publication Publié, 1991-03
Article révisé par les pairs
Résumé : After various attempts, an equivalence relation is defined for labelled Petri nets, on the base of the concurrency semantics of net theory. This relation, called Fully Concurrent bisimulation and abbreviated FC-bisimulation, preserves the level of concurrency of visible operations and, under some conditions, allows to enforce injective labelling on them. Refinements of a visible operation are also defined and we show that, under some conditions, they preserve FC-bisimulation. © 1991 Springer-Verlag.