Coarse abstractions make Zeno behaviours difficult to detect

DOI10.2168/LMCS-9(1:6)2013zbMath1260.68205OpenAlexW2624809536MaRDI QIDQ4913769

B. Srivathsan, Frédéric Herbreteau

Publication date: 9 April 2013

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2168/lmcs-9(1:6)2013

zbMATH Keywords

verificationtimed automataabstractionsZeno runs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Energy Büchi problems ⋮ Coarse Abstractions Make Zeno Behaviours Difficult to Detect

Uses Software

• REDLIB

This page was built for publication: Coarse abstractions make Zeno behaviours difficult to detect