Equations between Regular Terms and an Application to Process Logic

DOI10.1137/0214066zbMath0587.68031OpenAlexW2064200694MaRDI QIDQ3713595

Ashok K. Chandra, Joe Halpern, Rohit Parikh, Albert R. Meyer

Publication date: 1985

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0214066

zbMATH Keywords

regular expressionssatisfiability problemcontext-free languagelogic of programsvalidity problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Decidability of theories and sets of sentences (03B25)

Related Items (8)

Process logic: Expressiveness, decidability, completeness ⋮ Compositional reasoning using intervals and time reversal ⋮ Computational completeness of equations over sets of natural numbers ⋮ A decision procedure for propositional projection temporal logic with infinite models ⋮ A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time ⋮ Language equations ⋮ A Road Map of Interval Temporal Logics and Duration Calculi ⋮ A Road Map of Interval Temporal Logics and Duration Calculi

This page was built for publication: Equations between Regular Terms and an Application to Process Logic