Axiomatization using locality and free choice

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

• Kamal Lodaya, The Institute of Mathematical Sciences, Chennai
• Tuesday 16 July 2013, 11:00-12:00
• CS 217.

If you have a question about this talk, please contact Dan Ghica.

Salomaa gave an axiomatization for equivalence of regular expressions, and we know that checking equivalence is complete for polynomial space. Regular languages can be described more succinctly by using additional operations like synchronized shuffle (also called merge), renaming and hiding. Equivalence of these expressions for traces is axiomatized using Milner’s expansion law (or Bergstra and Klop’s left and right merge operations), and checking equivalence is complete for exponential space. If we disallow nesting of shuffle, renaming and hiding, checking equivalence is still in polynomial space. We give a proof system for a fragment. We do not use the expansion law. The syntax matches languages corresponding to 1-bounded free choice Petri nets.

This talk is part of the Lab Lunch series.

This talk is included in these lists:

• CS 217
• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• Lab Lunch
• Theoretical computer science seminar

Note that ex-directory lists are not shown.