A decidable fixpoint logic for time-outs

DOI10.1007/3-540-45694-5_18MaRDI QIDQ4484492zbMATH OpenFDO

Authors Maria Sorea

Publication date 12 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1400049
• 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)

• Resets vs. aborts in linear temporal logic
• scientific article; zbMATH DE number 2064461 (Why is no real title available?)
• A decidable timeout-based extension of linear temporal logic
• Reasoning about timeouts

This page was built for publication: A decidable fixpoint logic for time-outs

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