Conference paper
A new look at fault tolerant network routing
Danny Dolev, Joe Halpern, et al.
STOC 1984
Regular terms with the Kleene operations U,;, and ∗ can be thought of as operators on languages, generating other languages. An equation τ1 = τ2 between two such terms is said to be salisfiable just in case languages exist which make this equation true. We show that the satisfiability problem even for ∗-free regular terms is undecidable. Similar techniques are used to show that a very natural extension of the Process Logic of Harel, Kozen and Parikh is undecidable.
Danny Dolev, Joe Halpern, et al.
STOC 1984
Danny Dolev, Joe Halpern, et al.
STOC 1984
Jia-Wei Hong, Arnold L. Rosenberg
STOC 1981
Ashok Chandra, David Harel
Journal of Computer and System Sciences