Equations between Regular Terms and an Application to Process Logic
From MaRDI portal
Decidability of theories and sets of sentences (03B25) Modal logic (including the logic of norms) (03B45) Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)
Recommendations
Cited in
(14)- Process logic with regular formulas
- Process logic: Expressiveness, decidability, completeness
- Language equations
- 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
- scientific article; zbMATH DE number 3976998 (Why is no real title available?)
- scientific article; zbMATH DE number 3986629 (Why is no real title available?)
- scientific article; zbMATH DE number 35404 (Why is no real title available?)
- Theoretical Aspects of Computing – ICTAC 2005
- A Road Map of Interval Temporal Logics and Duration Calculi
- A Road Map of Interval Temporal Logics and Duration Calculi
- Decision problems for systems of language equations and inequations
This page was built for publication: Equations between Regular Terms and an Application to Process Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3713595)