Weak Nominal Modal Logic
| Autor: | Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Tjark Weber |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Bisimulation
Pure mathematics Logical equivalence Computer science Process calculus Modal logic 020207 software engineering 0102 computer and information sciences 02 engineering and technology 01 natural sciences Unobservable Rotation formalisms in three dimensions Conjunction (grammar) 010201 computation theory & mathematics Computer Science::Logic in Computer Science 0202 electrical engineering electronic engineering information engineering Computer Science::Programming Languages Computer Science::Formal Languages and Automata Theory AND gate |
| Zdroj: | Formal Techniques for Distributed Objects, Components, and Systems ISBN: 9783319602240 FORTE |
| DOI: | 10.1007/978-3-319-60225-7_13 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|