[isabelle] New AFP article: Modal Logics for Nominal Transition Systems

Modal Logics for Nominal Transition Systems
Tjark Weber, Lars-Henrik Eriksson, Joachim Parrow, Johannes BorgstrÃm and Ramunas Gutkovas

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.



Attachment: smime.p7s
Description: S/MIME Cryptographic Signature

This archive was generated by a fusion of Pipermail (Mailman edition) and MHonArc.