Bisimulation and Model-Checking for Partial Order Models of Concurrency

Add to your list(s) Download to your calendar using vCal

• Julian Gutierrez, University of Edinburgh
• Friday 11 March 2011, 14:00-15:00
• Room FW11, Computer Laboratory, William Gates Building.

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:

• All Talks (aka the CURE list)
• Cambridge talks
• Computer Laboratory talks
• Computing and Mathematics
• Interested Talks
• Logic and Semantics Seminar (Computer Laboratory)
• Room FW11, Computer Laboratory, William Gates Building
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• yk373's list

Note that ex-directory lists are not shown.