In: Distributed Computing, Vol. 4, pages 139-162. 1991.
Also in: Choffrut, C.; et al.: Lecture Notes in Computer Science, Vol. 415; STACS 90. Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science, 1990, Rouen, France, pages 285-297. Berlin, Germany: Springer-Verlag, 1990. Extended abstract.
Also as: Report TUM-I--8905, pages 1-27 pp.. München, Germany: Technische Universiät, Institut für Informatik, May 1989.
Abstract: In this paper concurrent systems are modelled with safe Petri nets. The coarsest equivalence contained in failures equivalence is determined that is a congruence with repsect to refinement. It is shown that in this context partial orders are necessary for the desciption of system runs: what is needed here are so-called interval orders.
Keywords: failure semantics (based on) interval semiword(s); partial order semantics; action refinement; interval order.