10 citations · 23 across the 6 of their papers we have counts for
7 papers
Shielded Reinforcement Learning for Hybrid Systems
Asger Horn Brorholt, Peter Gjøl Jensen, Kim Guldstrand Larsen +2
Safe and optimal controller synthesis for switched-controlled hybrid systems, which combine differential equations and discrete changes of the system's state, is known to be intric…
Timed I/O Automata: It is never too late to complete your timed specification theory
Martijn A. Goorden, Kim G. Larsen, Axel Legay +3
A specification theory combines notions of specifications and implementations with a satisfaction relation, a refinement relation and a set of operators supporting stepwise design.…
It's Time to Play Safe: Shield Synthesis for Timed Systems
Roderick Bloem, Peter Gjøl Jensen, Bettina Könighofer +3
Erroneous behaviour in safety critical real-time systems may inflict serious consequences. In this paper, we show how to synthesize timed shields from timed safety properties given…
COST Action IC 1402 ArVI: Runtime Verification Beyond Monitoring -- Activity Report of Working Group 1
Wolfgang Ahrendt, Cyrille Artho, Christian Colombo +9
This report presents the activities of the first working group of the COST Action ArVI, Runtime Verification beyond Monitoring. The report aims to provide an overview of some of th…
Effortless Fault Localisation: Conformance Testing of Real-Time Systems in Ecdar
Tobias R. Gundersen, Florian Lorber, Ulrik Nyman +1
Model checking of real-time systems has evolved throughout the years. Recently, the model checker Ecdar, using timed I/O automata, was used to perform compositional verification. H…
Learning Timed Automata via Genetic Programming
Martin Tappler, Bernhard K. Aichernig, Kim Guldstrand Larsen +1
Model learning has gained increasing interest in recent years. It derives behavioural models from test data of black-box systems. The main advantage offered by such techniques is t…
Bounded Determinization of Timed Automata with Silent Transitions
Florian Lorber, Amnon Rosenmann, Dejan Nickovic +1
Deterministic timed automata are strictly less expressive than their non-deterministic counterparts, which are again less expressive than those with silent transitions. As a conseq…