Automata on infinite objects are extensively used in system specification, verification, and synthesis. While some applications of the automata-theoretic approach have been wel...
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
This paper describes an overview of Environment for Memory Performance Studies (EMPS). EMPS is a framework to allow different data gathering and simulation tools to be composed to...
Jeffrey K. Hollingsworth, Allan Snavely, Simone Sb...
This short tool paper introduces MRMC, a model checker for discrete-time and continuous-time Markov reward models. It supports reward extensions of PCTL and CSL, and allows for th...
Joost-Pieter Katoen, Maneesh Khattri, Ivan S. Zapr...
The language of timed µCRL is an extension of an ACP-style process algebra-based language µCRL with time-related features. In this paper we describe this language and its equati...