Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10328888 | Electronic Notes in Theoretical Computer Science | 2005 | 30 Pages |
Abstract
I also extend various equivalence relations for concurrent systems to higher dimensional automata. These include the history preserving bisimulation, which is the coarsest equivalence that fully respects branching time, causality and their interplay, as well as the ST-bisimulation, a branching time respecting equivalence that takes causality into account to the extent that it is expressible by actions overlapping in time. Through their embeddings in higher dimensional automata, it is now well-defined whether members of different models of concurrency are equivalent.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
R.J. van Glabbeek,