150 citations · 623 across the 65 of their papers we have counts for
4 papers · 1 filter
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…
Secure Architectures Implementing Trusted Coalitions for Blockchained Distributed Learning (TCLearn)
Sebastien Lugan, Paul Desbordes, Luis Xavier Ramos Tormo +2
Distributed learning across a coalition of organizations allows the members of the coalition to train and share a model without sharing the data used to optimize this model. In thi…
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…
Variability Abstraction and Refinement for Game-based Lifted Model Checking of full CTL (Extended Version)
Aleksandar S. Dimovski, Axel Legay, Andrzej Wasowski
Variability models allow effective building of many custom model variants for various configurations. Lifted model checking for a variability model is capable of verifying all its…