@inproceedings{103ef38bbf2c4f40a936dba170014252,
title = "Equivalences and Refinement",
abstract = "We investigate equivalence notions for concurrent systems. We consider “linear time” approaches where the system behaviour is characterised as the set of possible runs as well as “branching time” approaches where the conflict structure of systems is taken into account. We show that the usual interleaving equivalences, and also the equivalences based on steps (multisets of concurrently executed actions) are not preserved by refinement of actions. We prove that “linear time” partial order semantics, where causality in runs is explicit, is invariant under refinement. Finally, we consider various bisimulation equivalences based on partial orders and show that the strongest one of them is preserved by refinement whereas the others are not.",
author = "{van Glabbeek}, R.J. and U. Goltz",
year = "1990",
month = nov,
day = "28",
doi = "10.1007/3-540-53479-213",
language = "English",
isbn = "978-3-540-53479-2",
volume = "469",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "309--333",
editor = "I. Guessarian",
booktitle = "Semantics of Systems of Concurrent Processes: LITP Spring School on Theoretical Computer Science, La Roche Posay, France, April 23–27, 1990 Proceedings",
address = "United Kingdom",
note = "The 1990 LITP Spring School on Theoretical Computer Science ; Conference date: 23-04-1990 Through 27-04-1990",
}