Paper: Regular Expressions in Process Algebra (at LICS 2005)

Authors: Jos C. M. Baeten Flavio Corradini

Abstract

We tackle an open question of Milner ([10]). We define a set of so-called well-behaved finite automata that, modulo bisimulation equivalence, corresponds exactly to the set of regular expressions.

BibTeX

  @InProceedings{BaetenCorradini-RegularExpressionsi,
    author = 	 {Jos C. M. Baeten and Flavio Corradini},
    title = 	 {Regular Expressions in Process Algebra},
    booktitle =  {Proceedings of the Twentieth Annual IEEE Symposium on Logic in Computer Science (LICS 2005)},
    year =	 {2005},
    month =	 {June}, 
    pages =      {12--19},
    location =   {Chicago, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }