scientific article; zbMATH DE number 1500558

zbMATH Open0954.03033MaRDI QIDQ4501577FDOQ4501577

Authors: Hung Dang van, Dimitar P. Guelev 

Publication date: 4 September 2000

Title of this publication is not available (Why is that?)

Recommendations

• On the completeness and decidability of duration calculus with iteration
• scientific article; zbMATH DE number 512815
• Automata for a decidable subset of duration calculus.
• scientific article; zbMATH DE number 1950253

zbMATH Keywords

hybrid systemsdecidabilityreal-time systemstimed automataproof systemduration calculus with iteration

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44) Logic in computer science (03B70)

Cited In (6)

• Title not available (Why is that?)
• Complete axiomatization of the stutter-invariant fragment of the linear time \(\mu\)-calculus
• On the completeness and decidability of duration calculus with iteration
• Decidability of a hybrid duration calculus
• Sharpening the incompleteness of the duration calculus
• Complete and terminating tableau for the logic of proper subinterval structures over dense orderings

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 Q4501577)