2 citations · 3 across the 6 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.FL2024
Checking Timed Bisimilarity with Virtual Clocks
Alexander Lieb, Hendrik Göttmann, Lars Luthmann +2
Timed automata are a widely used formalism for specifying the discrete-state/continuous-time behavior of time-critical reactive systems. For the fundamental verification problem of…
cs.SE2024★ 1 cited
Using weakest application conditions to rank graph transformations for graph repair
Lars Fritsche, Alexander Lauer, Maximilian Kratz +2
When using graphs and graph transformations to model systems, consistency is an important concern. While consistency has primarily been viewed as a binary property, i.e., a graph i…