Timed bounded verification of inclusion based on timed bounded discretized language

DOI10.1142/S0129054121500106MaRDI QIDQ5859682zbMATH OpenOpenAlexFDO

Authors Ikhlass Ammar, Yamen El Touati, 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

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

Mathematics Subject Classification ID

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

Recommendations

• On the distance between timed automata
• Time-Bounded Verification
• Verification for timed automata extended with unbounded discrete data structures
• Verification for Timed Automata extended with Unbounded Discrete Data Structures
• Hybrid Systems: Computation and Control

Cites work

• A theory of timed automata
• Event-clock automata: a determinizable class of timed automata
• scientific article; zbMATH DE number 1956642 (Why is no real title available?)
• The Theory of Timed I/O Automata
• Time-Bounded Verification
• Timed Automata with Integer Resets: Language Inclusion and Expressiveness
• Towards a theory of time-bounded verification
• When Are Timed Automata Determinizable?
• Zone-Based Universality Analysis for Single-Clock Timed Automata

Cited in

(2)

• Incremental Language Inclusion Checking for Networks of Timed Automata
• Timed non-interference under partial observability and bounded memory

This page was built for publication: Timed bounded verification of inclusion based on timed bounded discretized language

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