Home

Marius__Bozga


Efficient verification of timed automata using dense and discrete time semantics

On the Representation of Probabilities over Structured Domains

Some progress in the symbolic verification of timed automata