Euclidean model checking: A scalable method for verifying quantitative properties in probabilistic systems

Abstract

We typically represent the global state of a concurrent system as the crossproduct of individual states of its components. This leads to an explosion of potential global states: consider a concurrent system with a thousand actors, each of which may be in one of 5 states. This leads to a possible 5 1000 global states. Obviously, it is not feasible to exhaustively search the state space in such systems. In fact, actors often have an even larger number of states (than say 5), although these states may be abstracted to fewer states. © 2013 Springer-Verlag.