Regular expressions in process algebra

Abstract

We tackle an open question of Milner (1984). We define a set of so-called well-behaved finite automata that, modulo bisimulation equivalence, corresponds exactly to the set of regular expressions. 
DOI: 10.1109/LICS.2005.43

2 Figures and Tables

Topics

  • Presentations referencing similar topics