Communicating sequential processes
Communicating sequential processes
On the consistency of Koomen's fair abstraction rule
Theoretical Computer Science
Global renaming operators in concrete process algebra
Information and Computation
Process algebra
Process algebra with a zero object
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Some results on the generalized star-height problem
Information and Computation
Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM (JACM)
Handbook of logic in computer science (vol. 4)
Decidability results in automata and process theory
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
On the star height of unary regular behaviours
Proof, language, and interaction
L(A) = L(B)? decidability results from complete formal systems
Theoretical Computer Science
Decidability of DPDA equivalence
Theoretical Computer Science
Communication and Concurrency
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Nondeterministic regular expressions as solutions of equational systems
Theoretical Computer Science
Regular Expressions in Process Algebra
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Concurrency, Graphs and Models
A theory of contracts for Web services
ACM Transactions on Programming Languages and Systems (TOPLAS)
Contract-Based Discovery and Adaptation of Web Services
Formal Methods for Web Services
Contract-based discovery of Web services modulo simple orchestrators
Theoretical Computer Science
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
A process-theoretic look at automata
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
| Hi-index | 0.01 |
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 regular expressions, and we show how to determine whether a given finite automaton is in this set. As an application, we consider the star height problem.