scientific article; zbMATH DE number 1405651

MaRDI QIDQ4938632zbMATH OpenFDO

Authors Martin Dickhöfer, Thomas Wilke

Publication date 25 April 2000

zbMATH Keywords

model checkingtimed alternating tree automatatimed computation tree logic

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Timed tree automata with an application to temporal logic.
• Towards an Efficient Tree Automata based technique for Timed Systems
• Analyzing Timed Systems Using Tree Automata
• Analyzing timed systems using tree automata
• An automata-theoretic approach to branching-time model checking
• Model checking temporal-epistemic logic using alternating tree automata
• On MITL and alternating timed automata
• Lectures on Concurrency and Petri Nets
• The Power of Proofs: New Algorithms for Timed Automata Model Checking
• Formal Modeling and Analysis of Timed Systems

Cited in

(9)

• Finite automata on timed \(\omega\)-trees
• Quantitative vs. weighted automata
• A model of finite automata on timed omega-trees
• Towards deriving test sequences by model checking
• Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall
• An automata-theoretic approach to infinite-state systems
• A survey of timed automata for the development of real-time systems
• Analyzing Timed Systems Using Tree Automata
• Towards an Efficient Tree Automata based technique for Timed Systems

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