Weak Nominal Modal Logic - Formal Techniques for Distributed Objects, Components, and Systems Access content directly
Conference Papers Year : 2017

Weak Nominal Modal Logic

Joachim Parrow
  • Function : Author
  • PersonId : 1024702
Tjark Weber
  • Function : Author


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.
Fichier principal
Vignette du fichier
446833_1_En_13_Chapter.pdf (231.66 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01658420 , version 1 (07-12-2017)





Joachim Parrow, Tjark Weber, Johannes Borgström, Lars-Henrik Eriksson. Weak Nominal Modal Logic. 37th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2017, Neuchâtel, Switzerland. pp.179-193, ⟨10.1007/978-3-319-60225-7_13⟩. ⟨hal-01658420⟩
57 View
84 Download



Gmail Facebook X LinkedIn More