scientific article; zbMATH DE number 7577576
From MaRDI portal
Publication:5101345
Jaroslav Bendík, Ebru Aydin Gol, Ahmet Sencan, Ivana Černá
Publication date: 30 August 2022
Full work available at URL: https://arxiv.org/abs/2108.08018
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uses Software
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
- Quantified maximum satisfiability
- Analysing sanity of requirements for avionics systems
- Robust safety of timed automata
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
- A theory of timed automata
- On clock-aware LTL parameter synthesis of timed automata
- Minimal sets on propositional formulae. Problems and reductions
- Parametric verification: an introduction
- Timed automata relaxation for reachability
- An automated system repair framework with signal temporal logic
- 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
- Shrinking Timed Automata.
- Synthesis of Timing Parameters Satisfying Safety Properties
- Language Emptiness of Continuous-Time Parametric Timed Automata
- LTL Parameter Synthesis of Parametric Timed Automata
- Robustness in Timed Automata
- Evaluation of Domain Agnostic Approaches for Enumeration of Minimal Unsatisfiable Subsets
- 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
- Clock bound repair for timed systems
This page was built for publication:
