research-article

Equations between Regular Terms and an Application to Process Logic

Authors:

Rohit Parikh,

Ashok Chandra,

Joe Halpern,

Albert MeyerAuthors Info & Claims

SIAM Journal on Computing, Volume 14, Issue 4

Pages 935 - 942

https://doi.org/10.1137/0214066

Published: 01 November 1985 Publication History

Abstract

Regular terms with the Kleene operations $ \cup $, ; and $ * $ can be thought of as operators on languages, generating other languages. An equation $\tau _1 = \tau _2 $ 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.

References

[1]

G. Gabbay, A. Pnueli, S. Shelah, J. Stavi, The temporal analysis of fairness, 7th Annual ACM Symposium on Principles of Programming Languages, 1980, 163–173, Jan.

Google Scholar

[2]

J. Halpern, Deterministic process logic is elementary, Inform. and Control, 57 (1983), 56–89, Proc. 23rd IEEE Symposium on the Foundations of Computer Science, pp. 204–216

Google Scholar

[3]

David Harel, Two results on process logic, Inform. Process. Lett., 8 (1979), 195–198

Digital Library

Google Scholar

[4]

M. Harrison, Introduction to formal language theory, Addison-Wesley Publishing Co., Reading, Mass., 1978xiv+594

Digital Library

Google Scholar

[5]

David Harel, Dexter Kozen, Rohit Parikh, Process logic: expressiveness, decidability, completeness, J. Comput. System Sci., 25 (1982), 144–170, Proc. 21st IEEE Symposium on the Foundations of Computer Science, pp. 129–142

Crossref

Google Scholar

[6]

Joseph Halpern, Zohar Manna, Ben Moszkowski, A hardware semantics based on temporal intervalsAutomata, languages and programming (Barcelona, 1983), Lecture Notes in Comput. Sci., Vol. 154, Springer, Berlin, 1983, 278–291, Proc. 10th ICALP

Google Scholar

[7]

D. Harel, A. Pnueli, J. Stavi, Propositional dynamic logic on context-free programs, Proc. 22nd IEEE Symposium on the Foundations of Computer Science, 310–321

Google Scholar

[8]

Albert R. Meyer, R. Parikh, Weak monadic second order theory of succesor is not elementary-recursiveLogic Colloquium (Boston, Mass., 1972–1973), Springer, Berlin, 1975, 132–154. Lecture Notes in Math., Vol. 453

Google Scholar

[9]

Hirokazu Nishimura, Descriptively complete process logic, Acta Inform., 14 (1980), 359–369

Digital Library

Google Scholar

[10]

Rohit Parikh, A decidability result for a second order process logic19th Annual Symposium on Foundations of Computer Science (Ann Arbor, Mich., 1978), IEEE, Long Beach, Calif., 1978, 177–183, Oct.

Google Scholar

[11]

Rohit Parikh, E. Engeler, Propositional dynamic logics of programs: a surveyLogic of programs (Zürich, 1979), Lecture Notes in Comput. Sci., Vol. 125, Springer, Berlin, 1981, 102–144

Google Scholar

[12]

V. R. Pratt, Process Logic, Proc. 6th Annual ACM Symposium on Principles of Programming Languages, 1979, 93–100, Jan.

Google Scholar

[13]

M. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc., 141 (1969), 1–35

Google Scholar

Cited By

View all

Din CHähnle RHenrio LJohnsen EPun VTarifa S(2024)Locally Abstract, Globally Concrete Semantics of Concurrent Programming LanguagesACM Transactions on Programming Languages and Systems10.1145/364843946:1(1-58)Online publication date: 16-Feb-2024
https://dl.acm.org/doi/10.1145/3648439

Index Terms

Equations between Regular Terms and an Application to Process Logic

Index terms have been assigned to the content through auto-classification.

Recommendations

Regular patterns, regular languages and context-free languages

In this paper we consider two questions. First we consider whether every pattern language which is regular can be generated by a regular pattern. We show that this is indeed the case for extended (erasing) pattern languages if alphabet size is at least ...
Equations between regular terms and an application to process logic
STOC '81: Proceedings of the thirteenth annual ACM symposium on Theory of computing

Regular terms with the Kleene operations ∪,;, and * can be thought of as operators on languages, generating other languages. An equation r₁ = r₂ between two such terms is said to be satisfiable just in case languages exist which make this equation true. ...
On the sizes of DPDAs, PDAs, LBAs

There are languages A such that there is a Pushdown Automata (PDA) that recognizes A which is much smaller than any Deterministic Pushdown Automata (DPDA) that recognizes A. There are languages A such that there is a Linear Bounded Automata (Linear ...

Comments

Information & Contributors

Information

Published In

SIAM Journal on Computing Volume 14, Issue 4

Nov 1985

292 pages

ISSN:0097-5397

DOI:10.1137/smjcat.1985.14.issue-4

Issue’s Table of Contents

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 November 1985

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Din CHähnle RHenrio LJohnsen EPun VTarifa S(2024)Locally Abstract, Globally Concrete Semantics of Concurrent Programming LanguagesACM Transactions on Programming Languages and Systems10.1145/364843946:1(1-58)Online publication date: 16-Feb-2024
https://dl.acm.org/doi/10.1145/3648439

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Regular patterns, regular languages and context-free languages