On symmetric higher-dimensional automata and bisimilarity
Formal Languages and Automata Theory
2021-03-30 v1 Logic in Computer Science
Abstract
It is shown that a higher-dimensional automaton is hhp-bisimilar to the free symmetric HDA generated by it. Consequently, up to hereditary history-preserving bisimilarity, ordinary HDAs and symmetric HDAs are models of concurrency with the same expressive power.
Keywords
Cite
@article{arxiv.2103.15223,
title = {On symmetric higher-dimensional automata and bisimilarity},
author = {Thomas Kahl},
journal= {arXiv preprint arXiv:2103.15223},
year = {2021}
}