scientific article; zbMATH DE number 1927553

MaRDI QIDQ4484477zbMATH OpenFDO

Authors Alexander Rabinovich

Publication date 12 June 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2421/24210057.htm

Mathematics Subject Classification ID

Temporal logic (03B44) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• On expressive completeness of modal logic
• On the expressiveness of temporal logic programming
• Timed temporal logics
• Expressive completeness of temporal logic of trees
• Temporal logic can be more expressive

Cited in

(13)

• Future temporal logic needs infinitely many modalities
• On the expressiveness of temporal logic programming
• \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\)
• Logical foundations for more expressive declarative temporal logic programming languages
• Expressive completeness of temporal logic of action
• Implicates and reduction techniques for temporal logics
• Classifying discrete temporal properties
• On expressive completeness of modal logic
• Asymptotic behaviour in temporal logic
• The Expressive Power of Temporal Logic of Actions
• The Expressive Power of Temporal and First-Order Metric Logics
• Limiting Until in ordered tree query languages
• Arity hierarchy for temporal logics

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4484477)