%0 Conference Proceedings
%T Weak Nominal Modal Logic
%+ Uppsala University
%A Parrow, Joachim
%A Weber, Tjark
%A Borgström, Johannes
%A Eriksson, Lars-Henrik
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 37th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE)
%C Neuchâtel, Switzerland
%Y Ahmed Bouajjani
%Y Alexandra Silva
%I Springer International Publishing
%3 Formal Techniques for Distributed Objects, Components, and Systems
%V LNCS-10321
%P 179-193
%8 2017-06-19
%D 2017
%R 10.1007/978-3-319-60225-7_13
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01658420/document
%2 https://inria.hal.science/hal-01658420/file/446833_1_En_13_Chapter.pdf
%L hal-01658420
%U https://inria.hal.science/hal-01658420
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-FORTE
%~ IFIP-LNCS-10321