Compact symbolic representations of large labelled transition systems, based on binary decision diagrams (BDD), are discussed. Extensions of BDDs are considered, in order to represent stochastic transition systems for performability analysis. We introduce Decision Node BDDs, a novel stochastic extension of BDDs which preserves the structure and properties of purely functional BDDs. It is shown ...

This paper deals with the modular analysis of distributed concurrent systems modelled by Petri nets. The main analysis techniques of such systems suffer from the well-known problem of the combinatory explosion of state space. In order to cope with this problem, we use a modular representation of the state space instead of the ordinary one. The modular representation, namely modular state space,...

The state space explosion problem in model checking remains the chief obstacle to the practical veri cation of real-world distributed systems. We attempt to address this problem in the context of verifying concurrent (message-passing) C programs against safety speci cations. More speci cally, we present a fully automated compositional framework which combines two orthogonal abstraction techniqu...

Model checkers often face a state space explosion while verifying properties in programs with loops iterating over arrays. We present an abstraction which helps BMCs scale up and verify properties on arrays. Our technique transforms an array-manipulating C program to an array-free and loop-free program. The transformed program can then be verified by any bounded model checker without running in...

Existing strategies for verifying co-observability, one of the properties that must be satisfied for synthesizing solutions to decentralized supervisory control problems, require the construction of the complete system model. When the system is composed of many subsystems, these monolithic approaches may be impractical due to the state-space explosion problem. To address this issue, we introduc...

Model checking in probabilistic real-time temporal logic of knowledge PTACTLK confronts the same challenge as in traditional model checking, that is the state space explosion problem. Abstraction is one of the most effective methods to alleviate the state space explosion problem, under the traditional framework of two-valued abstraction, the abstract model obtained using abstraction techniques ...

Attack and compliance graphs are useful tools for cybersecurity regulatory or analysis. Thgraphs represent the state of a system set systems, can be used to identify all current future ways systems compromised at risk violating mandates. However, due their exhaustiveness thorough permutation checking, these suffer from space explosion - rapidly increase in total number states, likewise, generat...

Model checking is an automatic verification technique for hardware and software systems that are finite state or have finite state abstractions. It has been used successfully to verify computer hardware, and it is beginning to be used to verify computer software as well. As the number of state variables in the system increases, the size of the system state space grows exponentially. This is cal...

The state space of a real-time system can result in an innnite number of states due to unbounded time values. For automatic analysis based on state space exploration, it is important to be able to nitely represent the state space of a real-time system. In this paper, we present an approach that produces a compact representation of the reachable state space of a real-time system. The algorithm y...