Joachim Parrow, Tjark Weber, Johannes Borgström, and Lars-Henrik Eriksson. In Ahmed Bouajjani and Alexandra Silva, editors, Formal Techniques for Distributed Objects, Components, and Systems - 37th IFIP WG 6.1 International Conference, FORTE 2017, Held as Part of the 12th International Federated Conference on Distributed Computing Techniques, DisCoTec 2017, Neuchâtel, Switzerland, June 19-22, 2017, Proceedings, volume 10321 of Lecture Notes in Computer Science, pages 179-193. Springer, 2017.
Previous work on nominal transition systems explores strong bisimulation and a general kind of Hennessy-Milner logic with infinite but finitely supported conjunction, showing that it is remarkably expressive. In the present paper we treat weak bisimulation and the corresponding weak Hennessy-Milner logic, where there is a special unobservable action. We prove that logical equivalence coincides with bisimilarity and explore a few variants of the logic. In this way we get a general framework for weak bisimulation and logic in which formalisms such as the pi-calculus and its many variants can be uniformly represented.
@inproceedings{parrow17weak,
author = {Joachim Parrow and Tjark Weber and Johannes Borgstr{\"{o}}m and Lars{-}Henrik Eriksson},
title = {Weak Nominal Modal Logic},
editor = {Ahmed Bouajjani and Alexandra Silva},
booktitle = {Formal Techniques for Distributed Objects, Components, and Systems~-- 37th {IFIP} {WG}~6.1 International Conference, {FORTE} 2017, Held as Part of the 12th International Federated Conference on Distributed Computing Techniques, DisCoTec 2017, Neuch{\^{a}}tel, Switzerland, June~19-22, 2017, Proceedings},
volume = {10321},
series = {Lecture Notes in Computer Science},
pages = {179--193},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-60225-7\_13},
doi = {10.1007/978-3-319-60225-7\_13}
}