Sciweavers

JACM
2007
90views more  JACM 2007»
13 years 4 months ago
A characterization of regular expressions under bisimulation
We solve 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 reg...
Jos C. M. Baeten, Flavio Corradini, Clemens Grabma...
ICALP
1997
Springer
13 years 9 months ago
Axiomatizations for the Perpetual Loop in Process Algebra
Abstract. Milner proposed an axiomatization for the Kleene star in basic process algebra, in the presence of deadlock and empty process, modulo bisimulation equivalence. In this pa...
Wan Fokkink