A tool for the syntactic detection of Zeno-timelocks in timed automata

zbMATH Open1272.68229MaRDI QIDQ2851073FDOQ2851073

Authors: Li Su, Howard Bowman 

Publication date: 2 October 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066105051157

Recommendations

• How to stop time stopping
• Efficient Detection of Zeno Runs in Timed Automata
• Static detection of Zeno runs in UPPAAL networks based on synchronization matrices and two data-variable heuristics
• Coarse abstractions make Zeno behaviours difficult to detect
• Coarse abstractions make Zeno behaviours difficult to detect

Mathematics Subject Classification ID

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

Cited In (4)

• Efficient Detection of Zeno Runs in Timed Automata
• Static detection of Zeno runs in UPPAAL networks based on synchronization matrices and two data-variable heuristics
• How to stop time stopping
• Formal Approaches to Software Testing

Uses Software

• Kronos
• Uppaal2k
• Uppaal

This page was built for publication: A tool for the syntactic detection of Zeno-timelocks in timed automata

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