scientific article; zbMATH DE number 1927567

MaRDI QIDQ4484492zbMATH OpenFDO

Authors Maria Sorea

Publication date 12 June 2003

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70)

Recommendations

• Publication:4939602
• A decidable timeout-based extension of linear temporal logic
• Decidable metric logics
• From timed automata to logic -- and back
• Timer formulas and decidable metric temporal logic

Cited in

(4)

• scientific article; zbMATH DE number 1956573 (Why is no real title available?)
• scientific article; zbMATH DE number 2090022 (Why is no real title available?)
• scientific article; zbMATH DE number 2064461 (Why is no real title available?)
• A decidable timeout-based extension of linear temporal logic

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