![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Bisimulation and Model-Checking for Partial Order Models of Concurrency
Bisimulation and Model-Checking for Partial Order Models of ConcurrencyAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Bjarki Holm. In this talk I will present some results on logics and games used to study the bisimulation and model-checking problems for various partial order models of concurrency, which include Petri nets and event structures. In particular I will present: a number of mu-calculi (in this case, fixpoint extensions of modal logic) that, in certain classes of systems, induce the same identifications as some of the standard bisimulation equivalences for concurrency; secondly, a family of (infinite) higher-order logic games for verification where the players of the games are given (local) monadic second-order power on the sets of elements they are allowed to play. And, finally, a new order-theoretic concurrent game model where bisimulation and model-checking can be studied in a uniform way. This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsGenetics Postdoc Seminar Royal Aeronautical Society (RAeS) Cambridge Branch 7th Annual Building Bridges in Medical SciencesOther talksInternational Women's Day Lecture 2018: Press for Progress by Being an Active Bystander Using single-cell technologies and planarians to study stem cells, their differentiation and their evolution Lung Cancer. Part 1. Patient pathway and Intervention. Part 2. Lung Cancer: Futurescape On the climate change conversation Designing Active Macroscopic Heat Engines Modular Algorithm Analysis |