Technical Report LIT--214, pages 1-19 pp.. Université Libre de Bruxelles (Belgium), Laboratoire d'Informatique Théorique, March 1990.
Abstract: 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, ...
Keywords: (maximality preserving) bisimulation; action refinement; invisible action; place/transition net; prime event structure; process graph.
Back to the Petri Nets Bibliography