We propose an abstract framework for structural operational semantics, in which we prove that under suitable hypotheses bisimilarity is a congruence. We then refine the framework to prove soundness of bisimulation up to context, an efficient method for reducing the size of bisimulation relations. Finally, we demonstrate the flexibility of our approach by reproving known results about congruence of bisimilarity and soundness of bisimulation up to context, in three variants of the π-calculus.
Slides (lhc.pdf) | 64KiB |
Wed 16 JanDisplayed time zone: Belfast change
Wed 16 Jan
Displayed time zone: Belfast change
13:45 - 14:51 | |||
13:45 22mTalk | Familial Monads and Structural Operational Semantics Research Papers Tom Hirschowitz Univ. Grenoble Alpes, Univ. Savoie Mont Blanc, CNRS, LAMA, 73000 Chambéry Link to publication DOI Media Attached File Attached | ||
14:07 22mTalk | Bindings as Bounded Natural Functors Research Papers Jasmin Blanchette Vrije Universiteit Amsterdam, Lorenzo Gheri Middlesex University London, Andrei Popescu Middlesex University, London, Dmitriy Traytel ETH Zurich Link to publication DOI Media Attached File Attached | ||
14:29 22mTalk | Categorical Combinatorics of Scheduling and Synchronization in Game Semantics Research Papers Paul-André Melliès CNRS and University Paris Diderot Link to publication DOI Media Attached File Attached |