Code model checking of software components suffers from the well-known problem of state explosion when applied to highly parallel components, despite the fact that a single component typically comprises a smaller state space than the whole system. We present a technique that addresses the problem of state explosion in code checking of primitive components with the Java PathFinder in case the ch...

Model checking is an increasingly popular method for verification of safety-critical systems. The main obstacle of this verification method is a state space explosion problem and consequently high computational requirements of model checking algorithms. In order to make the model checking method practically feasible, it is necessary to develop powerful techniques for fighting state space explos...

Correspondence: [email protected] Math and Computer Science Department, Hobart and William Smith Colleges, 300 Pulteney St., Geneva, NY 14456, USA Abstract Background: Markov chain models of calcium release sites in living cells exhibit stochastic dynamics reminiscent of the experimentally observed phenomenon of calcium puffs and sparks. Such models often take the form of stochastic automata networks...

Attack tree (AT) is one of the widely used non-state-space models for security analysis. The basic formalism of AT does not take into account defense mechanisms. Defense trees (DTs) have been developed to investigate the effect of defense mechanisms using measures such as attack cost, security investment cost, return on attack (ROA) and return on investment (ROI). DT, however, places defense me...

In this thesis we develop a state space reduction technique for networks of timed automata based on unfoldings to alleviate the state space explosion problem due to concurrently enabled actions. For the purpose of verifying a system, standard model checking techniques construct its sequential state space that su ers an exponential growth when applied to distributed systems because of concurrent...

In this paper, we propose a method for ameliorating the state-space explosion that can occur in the context of multiagent reinforcement learning. In our method, an agent considers other agents’ states only when they interfere with each other in attaining their goals. Our idea is that the initial state-space of each agent does not include information about other spaces. Agents then automatically...

Currently, one of the major problems in explicit state model checking is state space explosion; the number of states in modern software systems is growing so rapidly that even the most advanced computers no longer provide enough power to compute a complete state space. Kastenberg and Rensink [1] have proposed a new algorithm to reduce state space. However there is no implementation and thus no ...

Previous research into symmetry reduction techniques have shown them to be successful in combatting the state-space explosion problem. We provide a brief overview of a fully automated technique for the application of symmetry reduction to partially symmetric systems.

Stochastic process algebras have been introduced in order to enable compositional performance analysis. The size of the state space is a limiting factor, especially if the system consists of many cooperating components. To fight state space explosion, compositional aggregation based on congruence relations can be applied. This paper addresses the computational complexity of minimisation algorit...

Stochastic process algebras have been introduced in order to enable compositional performance analysis. The size of the state space is a limiting factor, especially if the system consists of many cooperating components. To fight state space explosion, various proposals for compositional aggregation have been made. They rely on minimisation with respect to a congruence relation. This paper addre...