We introduce two abstract models for multithreaded programs based on dynamic networks of pushdown systems. We address the problem of symbolic reachability analysis for these models...
Abstract. In this paper we discuss the problem of calculating the reachable states of a dynamical system de ned by ordinary di erential equations or inclusions. We present a protot...
Abstract. The theory of formal verification is one of the main approaches to hybrid system analysis. Decidability questions for verification algorithms are obtained by constructi...
Gerardo Lafferriere, George J. Pappas, Shankar Sas...
This paper is focused on adapting symmetry reduction, a technique that is highly successful in traditional model checking, to stochastic hybrid systems. To that end, we first sho...