Weak Nominal Modal Logic

@inproceedings{Parrow2017WeakNM,
  title={Weak Nominal Modal Logic},
  author={Joachim Parrow and Tjark Weber and Johannes Borgstr{\"o}m and Lars-Henrik Eriksson},
  booktitle={FORTE},
  year={2017}
}
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… 

A Bisimilarity Congruence for the Applied pi-Calculus Sufficiently Coarse to Verify Privacy Properties

This paper is the first thorough investigation into the coarsest notion of bisimilarity for the applied pi-calculus that is a congruence relation: open barbed bisimilarity. An open variant of

Rule Formats for Nominal Process Calculi

TLDR
This work provides rule formats for the specifications of NRTSs that ensure that the associated NRTS is an NTS and applies them to the operational specifications of the early and late pi-calculus.

Modal Logics for Nominal Transition Systems

TLDR
This dissertation addresses some of the shortcomings of established models and theories in four ways: by introducing a general modal logic, extending a modelling language with types and a more general operation, providing an automated tool support, and adapting an established behavioural type theory to specify and verify systems with unreliable communication.

References

SHOWING 1-10 OF 27 REFERENCES

Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes

We study an extension of Hennessy-Milner logic for the i¾?-calculus which gives a sound and complete characterisation of representative behavioural preorders and equivalences over typed processes.

Weak Equivalences in Psi-Calculi

TLDR
It is proved that weak barbed equivalence coincides with weak bisimulation equivalence, which has the expected algebraic properties and that the corresponding observation congruence is preserved by all operators.

Modal Logics for Mobile Processes

A linear translation from CTL* to the first-order modal μ -calculus

First-order reasoning for higher-order concurrency

Nominal SOS

A congruence rule format for name-passing process calculi

A Logical Characterisation of Static Equivalence

Multiple-Labelled Transition Systems for nominal calculi and their logics†

TLDR
Mo is introduced, which is a logic inspired by Hennessy–Milner Logic and the μ-calculus that enables us to consider state properties in a distributed environment and the impact of actions and movements over the different sites.

Modal Logics for Nominal Transition Systems

TLDR
This dissertation addresses some of the shortcomings of established models and theories in four ways: by introducing a general modal logic, extending a modelling language with types and a more general operation, providing an automated tool support, and adapting an established behavioural type theory to specify and verify systems with unreliable communication.