Truly Concurrent Bisimilarities are Game Equivalent
Logic in Computer Science
2019-07-08 v1 Computer Science and Game Theory
Abstract
We design games for truly concurrent bisimilarities, including strongly truly concurrent bisimilarities and branching truly concurrent bisimilarities, such as pomset bisimilarities, step bisimilarities, history-preserving bisimilarities and hereditary history-preserving bisimilarities.
Cite
@article{arxiv.1907.02860,
title = {Truly Concurrent Bisimilarities are Game Equivalent},
author = {Yong Wang},
journal= {arXiv preprint arXiv:1907.02860},
year = {2019}
}
Comments
7 pages