| Home |
| About |
| Submission |
| Updating Entries |
| Using Entries |
| Search |
| Statistics |
| Index |
| Download |
Modal Logics for Nominal Transition Systems
| Title: | Modal Logics for Nominal Transition Systems |
| Authors: | Tjark Weber (tjark /dot/ weber /at/ it /dot/ uu /dot/ se), Lars-Henrik Eriksson (lhe /at/ it /dot/ uu /dot/ se), Joachim Parrow (joachim /dot/ parrow /at/ it /dot/ uu /dot/ se), Johannes Borgström (johannes /dot/ borgstrom /at/ it /dot/ uu /dot/ se) and Ramunas Gutkovas (ramunas /dot/ gutkovas /at/ it /dot/ uu /dot/ se) |
| Submission date: | 2016-10-25 |
| Abstract: | We formalize a uniform semantic substrate for a wide variety of process calculi where states and action labels can be from arbitrary nominal sets. A Hennessy-Milner logic for these systems is defined, and proved adequate for bisimulation equivalence. A main novelty is the construction of an infinitary nominal data type to model formulas with (finitely supported) infinite conjunctions and actions that may contain binding names. The logic is generalized to treat different bisimulation variants such as early, late and open in a systematic way. |
| Change history: | [2017-01-29]: Formalization of weak bisimilarity added (revision c87cc2057d9c) |
| BibTeX: |
@article{Modal_Logics_for_NTS-AFP,
author = {Tjark Weber and Lars-Henrik Eriksson and Joachim Parrow and Johannes Borgström and Ramunas Gutkovas},
title = {Modal Logics for Nominal Transition Systems},
journal = {Archive of Formal Proofs},
month = oct,
year = 2016,
note = {\url{http://isa-afp.org/entries/Modal_Logics_for_NTS.html},
Formal proof development},
ISSN = {2150-914x},
}
|
| License: | BSD License |
| Depends on: | Nominal2 |
| Status: [ok] | This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations. |
|
Proof outline Proof document |
| Browse theories |
| Download this entry |