Incremental Language Inclusion Checking for Networks of Timed Automata

DOI10.1007/978-3-642-40229-6_11MaRDI QIDQ2842668zbMATH OpenOpenAlexFDO

Authors Willibald Krenn, Dejan Ničković, Loredana Tec

Publication date 16 August 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40229-6_11

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Timed bounded verification of inclusion based on timed bounded discretized language
• Model checking linear duration invariants of networks of automata
• Timed Automata with Integer Resets: Language Inclusion and Expressiveness
• Parameterized model checking of networks of timed automata with Boolean guards
• scientific article; zbMATH DE number 1956642
• Revisiting local time semantics for networks of timed automata
• Verification of timed automata via satisfiability checking
• Exact Incremental Analysis of Timed Automata with an SMT-Solver
• Component-wise incremental LTL model checking

Cited in

(1)

• Uniform sampling for timed automata with application to language inclusion measurement

This page was built for publication: Incremental Language Inclusion Checking for Networks of Timed Automata

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