Checking timed Büchi automata emptiness on simulation graphs

DOI10.1145/1507244.1507245zbMATH Open1352.68165OpenAlexW2162181585MaRDI QIDQ2946573FDOQ2946573

Authors: Stavros Tripakis 

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1507244.1507245

Recommendations

• Checking timed Büchi automata emptiness efficiently
• Efficient on-the-fly emptiness check for timed Büchi automata
• Efficient emptiness check for timed Büchi automata
• Checking timed Büchi automata emptiness using LU-abstractions
• A theory of timed automata

zbMATH Keywords

model checkingformal methodsspecification languagesproperty-preserving abstractionstimed Büchi automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (13)

• A survey of timed automata for the development of real-time systems
• Fast zone-based algorithms for reachability in pushdown timed automata
• Certifying emptiness of timed Büchi automata
• Efficient on-the-fly emptiness check for timed Büchi automata
• Coarse abstractions make Zeno behaviours difficult to detect
• On clock-aware LTL parameter synthesis of timed automata
• Checking timed Büchi automata emptiness efficiently
• Model Checking Real-Time Systems
• Efficient emptiness check for timed Büchi automata
• On the timed temporal logic planning of coupled multi-agent systems
• Checking timed Büchi automata emptiness using LU-abstractions
• A menagerie of timed automata
• Geometrical and analytical characterizations of positively homogeneous functions

Uses Software

• Kronos
• Uppaal

This page was built for publication: Checking timed Büchi automata emptiness on simulation graphs

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