Equations between regular terms and an application to process logic

Authors:
Ashok Chandra;Joe Halpern;Albert Meyer;Rohit Parikh
Affiliations:
-;-;-;-
Venue:
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Year:
1981

Citing 3
Cited 3

On the temporal analysis of fairness

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Introduction to Formal Language Theory

Introduction to Formal Language Theory
Process logic: Expressiveness, decidability, completeness

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science

Is the interesting part of process logic uninteresting?: a translation from PL to PDL

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Forays into Sequential Composition and Concatenation in Eagle

Runtime Verification
Compositionality of fixpoint logic with chop

ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Regular terms with the Kleene operations &ugr;,;, and * can be thought of as operators on languages, generating other languages. An equation r1 &equil; r2 between two such terms is said to be satisfiable 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.