Finitary Truly Concurrent Bisimulations
Logic in Computer Science
2026-05-11 v1
Abstract
To develop a full abstract denotational model of a process language based on prebisimulation preorder, its behavioural semantics has two problems: (1) Two processes related by a standard denotational interpretation afford the same finite observations. (2) Prebisimulation can make distinctions between the behaviours of two processes based on infinite observations. So, finitary part of prebisimulation is needed to obtain full abstract results. There existed two main results on finitary bisimulation: the logical form and the behavioural form. Following the latter one, we give the definitions of truly concurrent prebisimulations and their finitary ones.
Cite
@article{arxiv.2605.07373,
title = {Finitary Truly Concurrent Bisimulations},
author = {Yong Wang},
journal= {arXiv preprint arXiv:2605.07373},
year = {2026}
}