Automata for a decidable subset of duration calculus.

MaRDI QIDQ2737553zbMATH OpenFDO

Authors Cătălin Dima

Publication date 1999

zbMATH Keywords

real-time constraints

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 512815
• Decidability of a hybrid duration calculus
• Automata and temporal logic over arbitrary linear time
• scientific article; zbMATH DE number 1342250
• On the completeness and decidability of duration calculus with iteration
• scientific article; zbMATH DE number 4769
• scientific article; zbMATH DE number 1798172
• A decidable extension of data automata
• scientific article; zbMATH DE number 1444359

Cited in

(2)

• Duration-constrained regular expressions
• scientific article; zbMATH DE number 1500558 (Why is no real title available?)

This page was built for publication: Automata for a decidable subset of duration calculus.

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