2 papers
cs.LO2019
Modal Logics for Nominal Transition Systems
Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson +2
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 lo…
cs.LO2016
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…