An approach to state space reduction for systems with dynamic process creation

Abstract

Automated verification of dynamic multi-threaded computing systems can be adversely affected by problems relating to dynamic process creation. We therefore investigatein a general setting of labelled transition systems-a way of reducing the state spaces of multi-threaded systems. At the heart of our method is a state equivalence, which may produce a finite representation of an infinite state system while still allowing to validate the relevant behavioural properties. We demonstrate the feasibility of the method through experiments involving the checking of the proposed state equivalence.

Effective Marking Equivalence Checking in Systems with Dynamic Process Creation

“…The problem of reasoning about this kind of systems has lead to the development of different formalisms and methods [15]. Here, we focus on an implementation in terms of Petri nets [8] which allows for dynamic process creation and is mainly based on [6]. First we refine the definition of process identifiers that will be used through this paper, the definition is compatible with the one from [6].…”

“…Here, we focus on an implementation in terms of Petri nets [8] which allows for dynamic process creation and is mainly based on [6]. First we refine the definition of process identifiers that will be used through this paper, the definition is compatible with the one from [6]. The only difference is the introduction of an empty pid that helps the formal definition of pids.…”

“…• subpid(π) = {π} ∪ subpid(prefix(π)) if length(π) > 0 and / 0 otherwise. Now as in [6] we define the operations that can be used to compare process identifiers in a model. The following operations are the only ones that can be used in the model to compare pids, any other operation is forbidden.…”

State Space Exploration of Spatially Organized Populations of Agents

“…For the latter research direction, the actual IRN specification restrictions ensure finiteness of the state space, but may become artificial in practice. Some of these restrictions may be relaxed by resorting to abstraction and specific reduction techniques, like those in [9], [10], which originally have been designed for systems with dynamic process creation.…”

Modelling, verification, and formal analysis of security properties in a P2P system

“…Note that for the example shown above this process would not terminate because the state graph is infinite, therefore such explicit state graph can be used only for system with finitely many markings. Otherwise, solutions exist to handle symbolically infinite state graphs, usually through approximations or abstractions (e.g., [10,7,14]). The ABCD specification defines a number of agents (i.e.…”