The UML lacks precise and formal foundations for several constructs such as transition guards or method bodies, for which it resorts to semantic loopholes in the form of “uninter...
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...
Abstract. Recent investigations have shown that the automated verification of continuous-time Markov chains (CTMCs) against CSL (Continuous Stochastic Logic) can be performed in a...