Parity games are 2-player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model...
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
This work extends the game-based framework of µ-calculus model checking to the multi-valued setting. In multi-valued model checking a formula is interpreted over a Kripke structur...
We introduce a technique that can be used to model the behaviour of protocols. In our model each process within a protocol belongs to a particular class. A set of rules governs th...
In this paper, we present weighted/priced timed automata, an extension of timed automaton with costs, and solve several interesting problems on that model. Key words: Weighted/pri...