The objective of this collaborative textbook is to present the state of ...
Network congestion games are a convenient model for reasoning about rout...
We consider the parameterized verification problem for distributed algor...
Congestion games are a classical type of games studied in game theory, i...
Active learning of timed languages is concerned with the inference of ti...
Requirements engineering is a key phase in the development process. Ensu...
We study games with reachability objectives under energy constraints. We...
Temporal logics are extensively used for the specification of on-going
b...
In this paper, we are interested in the synthesis of schedulers in
doubl...
Parametric timed automata (PTA) are a powerful formalism to model and re...
Reconfigurable broadcast networks provide a convenient formalism for
mod...
Dynamic complexity is concerned with updating the output of a problem wh...