University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > Reasoning about concurrent stochastic systems

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Reasoning about concurrent stochastic systems

Download to your calendar using vCal

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins .

Complex networks are often modelled as stochastic processes, to encapsulate a lack of knowledge or inherent non-determinism. Such systems are frequently modular in nature, consisting of parts which are systems in their own right. Their global behaviour depends on the behaviours of their parts and on the topology of the network. This talk focuses on identifying the mathematical structure of these systems and investigates the possibility to define a general (qualitative and quantitative) logical framework appropriate for modular analysis. By modular analysis we mean a scale-up approach that proves properties of an upper level system from the properties of its subsystems. On this direction, it is also possible to define distances between stochastic processes which measure their behavioural or structural similarities.

This talk is part of the Microsoft Research Cambridge, public talks series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Keynes Seminar Room 2, King's College, Cambridge HEP Seminar Room, Cavendish Laboratory, Department of Physics https://zoom.us/j/99301642413

Other talks

Title to be confirmed Title to follow César Milstein Lecture - Title TBC Pollution in Helmholtz boundary integral methods Title to be confirmed Title to be confirmed
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity