University of Birmingham > Talks@bham > Theoretical computer science seminar > Concurrent Games on Partial Orders

Concurrent Games on Partial Orders

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

If you have a question about this talk, please contact Paul Levy.

In this talk I will present an order-theoretic concurrent game model and some of its mathematical properties and algorithmic applications. The model provides a game-theoretic approach to system and property verification which applies uniformly to different decision problems and models of concurrency. In particular, this framework uses partial orders to give a uniform representation of concurrent systems, logical specifications, and problem descriptions. Due to this, it is particularly suitable for reasoning about concurrent systems with partial order semantics, such as Petri nets or event structures. The model builds a bridge between some mathematical concepts in order theory and the more operational world of games. Moreover, it comes with generic metatheorems for soundness, completeness, and determinacy, and reduces reasoning on partially ordered structures by focusing on simple local correctness conditions. Two specific applications will be mentioned: bisimulation and mu-calculus model-checking.

This talk is part of the Theoretical computer science seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.