activity
20082025
most citedUPPAAL-SMC: Statistical Model Checking for Priced Timed Automata

150 citations · 623 across the 65 of their papers we have counts for

collaborators
Showing cs.LOShow all

27 papers · 1 filter

cs.LO2020

Behavioral Specification Theories: an Algebraic Taxonomy

Uli Fahrenberg, Axel Legay

We develop a taxonomy of different behavioral specification theories and expose their algebraic properties. We start by clarifying what precisely constitutes a behavioral specifica…

cs.LO2020

Featured Games

Uli Fahrenberg, Axel Legay

Feature-based SPL analysis and family-based model checking have seen rapid development. Many model checking problems can be reduced to two-player games on finite graphs. A prominen…

cs.LO2019

Computing Branching Distances Using Quantitative Games

Uli Fahrenberg, Axel Legay, Karin Quaas

We lay out a general method for computing branching distances between labeled transition systems. We translate the quantitative games used for defining these distances to other, pa…

cs.LO2019★ 2 cited

Sequential Relational Decomposition

Dror Fried, Axel Legay, Joël Ouaknine +1

The concept of decomposition in computer science and engineering is considered a fundamental component of computational thinking and is prevalent in design of algorithms, software…

cs.LO2017

An -Algebra for Real-Time Energy Problems

David Cachera, Uli Fahrenberg, Axel Legay

We develop a -continuous Kleene -algebra of real-time energy functions. Together with corresponding automata, these can be used to model systems which can consume and regain…

cs.LO2016

A Linear-Time Branching-Time Spectrum for Behavioral Specification Theories

Uli Fahrenberg, Axel Legay

We propose behavioral specification theories for most equivalences in the linear-time--branching-time spectrum. Almost all previous work on specification theories focuses on bisimi…