Coarse Abstractions Make Zeno Behaviours Difficult to Detect

DOI10.1007/978-3-642-23217-6_7zbMath1343.68139OpenAlexW2112744184MaRDI QIDQ3090824

B. Srivathsan, Frédéric Herbreteau

Publication date: 2 September 2011

Published in: CONCUR 2011 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: http://publications.rwth-aachen.de/record/212197

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Efficient emptiness check for timed Büchi automata

Uses Software

• Kronos
• REDLIB

Cites Work

• Checking timed Büchi automata emptiness efficiently
• How to stop time stopping
• A theory of timed automata
• Forward analysis of updatable timed automata
• Checking timed Büchi automata emptiness on simulation graphs
• Efficient Detection of Zeno Runs in Timed Automata
• Checking Timed Büchi Automata Emptiness Using LU-Abstractions
• Coarse abstractions make Zeno behaviours difficult to detect

This page was built for publication: Coarse Abstractions Make Zeno Behaviours Difficult to Detect