University of Birmingham > Talks@bham > Lab Lunch > Trace equivalence of well-founded processes via commutativity

  Browse A-Z

Log in

System Admin (disabled)details Birmingham usersdetails No account?details

Information on

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

Trace equivalence of well-founded processes via commutativity

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

If you have a question about this talk, please contact Uday Reddy.

Gordon Plotkin showed that the set of well-founded processes that perform I/O and finite nondeterminism, taken modulo trace equivalence, is initial among semilattice algebras whose algebra operations commute with binary join. We see that similar phenomena arise for unbounded nondeterminism and finite probabilistic choice. The situation for countable probabilistic choice is work in progress.

Joint work with Nathan Bowler (Hamburg).

This talk is part of the Lab Lunch series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Applied Topology Colloquium analysis Type the title of a new list here

Other talks

TBC
 

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