Timed Bounded Verification of Inclusion Based on Timed Bounded Discretized Language

DOI10.1142/S0129054121500106zbMath1458.68111OpenAlexW3120557648MaRDI QIDQ5859682

Yamen El Touati, Ikhlass Ammar, Moez Yeddes, John Mullins

Publication date: 19 April 2021

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054121500106

zbMATH Keywords

timed automatabounded inclusion problemdiscrete timed wordminimum and maximum execution timestimed bounded discretized language

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Event-clock automata: a determinizable class of timed automata
• A theory of timed automata
• The Theory of Timed I/O Automata
• Time-Bounded Verification
• Zone-Based Universality Analysis for Single-Clock Timed Automata
• Timed Automata with Integer Resets: Language Inclusion and Expressiveness
• Towards a Theory of Time-Bounded Verification
• When Are Timed Automata Determinizable?

This page was built for publication: Timed Bounded Verification of Inclusion Based on Timed Bounded Discretized Language