Timed automata relaxation for reachability

DOI10.1007/978-3-030-72016-2_16zbMath1467.68079OpenAlexW3117866502MaRDI QIDQ2044206

Ivana Černá, Ebru Aydin Gol, Jaroslav Bendík, Ahmet Sencan

Publication date: 4 August 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-72016-2_16

zbMATH Keywords

reachabilityrelaxationtimed automata

Mathematics Subject Classification ID

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

Related Items (3)

Automated repair for timed systems ⋮ Repairing real-time requirements ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On computing minimal independent support and its applications to sampling and counting
• Fast, flexible MUS enumeration
• Analysing sanity of requirements for avionics systems
• A theory of timed automata
• Time-abstracted bisimulation: Implicit specifications and decidability
• On clock-aware LTL parameter synthesis of timed automata
• Minimal sets on propositional formulae. Problems and reductions
• Parametric verification: an introduction
• Verification of an industrial asynchronous leader election algorithm using abstractions and parametric model checking
• On the optimal reachability problem of weighted timed automata
• Finding a Collection of MUSes Incrementally
• Bounded Model Checking for Parametric Timed Automata
• Language Emptiness of Continuous-Time Parametric Timed Automata
• LTL Parameter Synthesis of Parametric Timed Automata
• Integer Parameter Synthesis for Timed Automata
• Synthesising Robust and Optimal Parameters for Cardiac Pacemakers Using Symbolic and Evolutionary Computation Techniques
• Online Enumeration of All Minimal Inductive Validity Cores
• Recursive online enumeration of all minimal unsatisfiable subsets

This page was built for publication: Timed automata relaxation for reachability