Weakly True Concurrency and Its Logic
Logic in Computer Science
2016-06-22 v1
Abstract
We firstly find the existence of silent event in true concurrency (named weakly true concurrency) by defining weakly true concurrent behaviors and weakly true concurrent logics. Based on Paolo Baldan and Silvia Crafa's comprehensive work on (strongly) true concurrency, we find the correspondence between weakly true concurrent equivalences and weakly true concurrent logics.
Cite
@article{arxiv.1606.06422,
title = {Weakly True Concurrency and Its Logic},
author = {Yong Wang},
journal= {arXiv preprint arXiv:1606.06422},
year = {2016}
}
Comments
arXiv admin note: text overlap with arXiv:1110.4094 by other authors