par Devillers, Raymond
Référence Theoretical computer science, 102, 1, page (165-183)
Publication Publié, 1992-08
Article révisé par les pairs
Résumé : A new bisimulation notion is introduced for the specification of concurrent systems, which resists to a large class of action refinements, even in the presence of invisible actions. The work is presented in the context of labelled P/T nets, but it may be transported to other popular frameworks like prime event structures, process graphs, etc. © 1992.