Search

• < Previous
• 1
• Next >

---

The Largest Respectful Function

Joachim Parrow ; Tjark Weber.

Respectful functions were introduced by Sangiorgi as a compositional tool to formulate short and clear bisimulation proofs. Usually, the larger the respectful function, the easier the bisimulation proof. In particular the largest respectful function, defined as the pointwise union of all respectful&nbsp;[&hellip;]

---

Modal Logics for Nominal Transition Systems

Joachim Parrow ; Johannes Borgström ; Lars-Henrik Eriksson ; Ramūnas Forsberg Gutkovas ; Tjark Weber.

We define a general notion of transition system where states and action labels can be from arbitrary nominal sets, actions may bind names, and state predicates from an arbitrary logic define properties of states. A Hennessy-Milner logic for these systems is introduced, and proved adequate and&nbsp;[&hellip;]

---