Compositional minimisation of finite state systems using interface specifications

The Saturation-style fixpoint iteration strategy for symbolic reachability analysis is particularly effective for globally asynchronous locally synchronous discrete-state systems. However, its inherently sequential nature makes it difficult to parallelize Saturation on a network workstations (NOW). We then propose the idea of using idle workstation time to perform speculative image computations. Since an unrestrained prediction may make excessive use of computational resources, we introduce a history-based approach to dynamically recognize image computation (event firing) patterns and explore only firings that conform to these patterns. In addition, we employ an implicit encoding for the patterns, so that the actual image computation history can be efficiently preserved. Experiments not only show that image speculation works on a realistic model, but also indicate that the use of an implicit encoding together with two heuristics results in a better informed speculation.

show abstract

“…• Round robin mutex protocol (Robin) [16] models a round robin solution to the mutual exclusion problem. N is the number of processes involved.…”

Section: Resultsmentioning

confidence: 99%

Speculative Image Computation for Distributed Symbolic Reachability Analysis

Chung

Ciardo

2009

Journal of Logic and Computation

View full text Add to dashboard Cite

show abstract

“…The result of model checking is the same if we use the assumption or the original process. Second, while using the assumption may significantly accelerate the model checking, there is no penalty in the form of increased complexity as introduced by the intermediate state explosion problem [10,8] or by using deterministic automata [6,2,1,8]. In the worst case, the generated assumption is as large as the process itself.…”

Section: Discussionmentioning

confidence: 99%

“…This reduction technique resembles the methods for process minimization used in compositional reachability analysis [21,22,10,3], which reduce a partially composed system to an observationally equivalent process. However, our equivalence relation is different: rather than preserving the entire observational behavior of a process, we only preserve the reachability of an error.…”

Section: Introductionmentioning

confidence: 99%

Automatic Synthesis of Assumptions for Compositional Model Checking

Finkbeiner

Schewe

Brill

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We present a new technique for automatically synthesizing the assumptions needed in compositional model checking. The compositional approach reduces the proof that a property is satisfied by the parallel composition of two processes to the simpler argument that the property is guaranteed by one process provided that the other process satisfies an assumption A. Finding A manually is a difficult task that requires detailed insight into how the processes cooperate to satisfy the property. Previous methods to construct A automatically were based on the learning algorithm L * , which represents A as a deterministic automaton and therefore has exponential worst-case complexity. Our new technique instead represents A as an equivalence relation on the states, which allows for a quasi-linear construction. The model checker can therefore apply compositional reasoning without risking an exponential penalty for computing A.

show abstract

“…This issue has been addressed by enhanced compositional verification approaches [19,7,37,8,9,18,26,6,16], which permit the generation of the Lts of an individual process by taking into account interface constraints (also known as environment constraints or context constraints). These constraints express the behavioural restrictions imposed on the considered process by synchronization with its neighbour processes.…”

Section: Introductionmentioning

confidence: 99%

“…This approach is supported in the framework of Csp by the Tracta tool [16]. In the second approach, the process is constrained using a specific semi-composition operator [19,18,26], which cuts the process states and transitions that cannot be reached when considering the traces of the interface as the only possible interactions between the process and its environment. This approach is supported in the framework of Lotos by the Projector [26] and Svl [12] tools of Cadp (Construction and Analysis of Distributed Processes) [13] and was used in the verification of an industrial protocol [35].…”

Section: Introductionmentioning

confidence: 99%

Refined Interfaces for Compositional Verification

Lang

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The compositional verification approach of Graf & Steffen aims at avoiding state space explosion for individual processes of a concurrent system. It relies on interfaces that express the behavioural constraints imposed on each process by synchronization with the other processes, thus preventing the exploration of states and transitions that would not be reachable in the global state space. Krimm & Mounier, and Cheung & Kramer proposed two techniques to generate such interfaces automatically. In this paper, we propose a refined interface generation technique, in which the interface of a process is derived automatically from the examination of (a subset of) concurrent processes. This technique is applicable to formalisms in which concurrent processes are composed either using synchronization vectors or process algebra parallel composition operators (including those of Ccs, Csp, μCrl, Lotos, and E-Lotos), for which we developed a tool. Several experiments indicate state space reductions by more than two orders of magnitude for the largest processes.

show abstract

Compositional minimisation of finite state systems using interface specifications

Cited by 93 publications

References 13 publications

Speculative Image Computation for Distributed Symbolic Reachability Analysis

Speculative Image Computation for Distributed Symbolic Reachability Analysis

Automatic Synthesis of Assumptions for Compositional Model Checking

Refined Interfaces for Compositional Verification

Contact Info

Product

Resources

About