A State Space Distribution Policy Based on Abstract Interpretation

Orzan, Simona; Pol, Jaco van de; Espada, Miguel Valero

doi:10.1016/j.entcs.2004.10.017

Cited by 18 publications

(11 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [32], the tool was used to attempt to improve the performance of distributed algorithms for model checking and state space reduction. The idea is to introduce a new distribution policy of state spaces over workers.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

An abstract interpretation toolkit for μCRL

Espada

Pol

2006

Form Method Syst Des

View full text Add to dashboard Cite

This paper describes a toolkit that assists in the task of generating abstract approximations of process algebraic specifications written in the language µCRL. Abstractions are represented by Modal Labelled Transition Systems, which are mixed transition systems with may and must modalities. The approach permits to infer the satisfaction or refutation of safety and liveness properties expressed in the (action-based) µ-calculus. The tool supports the abstraction of states and action labels, which allows to deal with infinitely branching systems.Keywords Model checking . Process algebra . muCRL . Abstract interpretation 1 Introduction

show abstract

Section: Conclusion and Related Workmentioning

confidence: 99%

An abstract interpretation toolkit for μCRL

Espada

Pol

2006

Form Method Syst Des

View full text Add to dashboard Cite

show abstract

“…To attain the mentioned points, one can use heuristics that depend on the user's intuition, as proposed by Ciardo [6], or some previous analysis for extracting relevant information to define the partitioning, as proposed by Orzan [20].…”

Section: Partitioningmentioning

confidence: 99%

“…Locality means that number of transitions linking states that belong to different machines must be small as possible to minimize the overhead of communication. Temporal balance means that the every partition must be processed in parallel most of the time [6,20].…”

Section: Partitioningmentioning

confidence: 99%

“…In distributed state space verification, computation speedup is associated with the concept of locality and balance [6,20]. Locality means that the number of transitions linking states that belong to different machines must be small as possible to minimize the overhead of communication.…”

Section: Introductionmentioning

confidence: 99%

“…The enumeration of all reachable states of an industrial-scale system can exhausts the memory and CPU time of a single machine. In the last decade, parallel and distributed verification tools have been developed in order to alleviate the state explosion problem [4,6,13,18,20,24].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Bag-of-Tasks Approach for State Space Exploration Using Computational Grids

Rodrigues

Barbosa

Cabral

et al.

Fourth IEEE International Conference on Software Engineering and Formal Methods (SEFM'06)

View full text Add to dashboard Cite

A strategy for exploring distributed state spaces using computational grids that run bag-of-task applications is discussed. The main idea is to use computational grid tools as a layer between the verification tool and the distributed shared resources, aggregating the vast background developed by researchers in grid computing. Hence, the computational grid deals with resource scalability, computational speedup, and reliability in a transparent manner for the verification tool. Experimental results using a state space generation tool for an object-oriented Petri nets and the OurGrid solution show that is possible to achieve speedup applying it to a private network environment. Moreover, when a wide distributed community is considered, the model size can be increased several times.

show abstract

Equivalence Checking 40 Years After: A Review of Bisimulation Tools

Garavel

Lang

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Equivalence checking is a formal verification approach that consists in proving that two programs or models are related modulo some equivalence relation, or that one is included in the other modulo some preorder relation. In the case of concurrent systems, which are often represented using labelled transition systems, the relations used for equivalence checking are bisimulations and their simulation preorders. In the case of probabilistic or stochastic systems, which are usually represented using Markov chains, the relations used for equivalence checking are lumpability, probabilistic and stochastic equivalences, and their associated preorders. The present article provides a synthetic overview of 40 years of research in the design of algorithms and software tools for equivalence checking.

show abstract

A State Space Distribution Policy Based on Abstract Interpretation

Cited by 18 publications

References 8 publications

An abstract interpretation toolkit for μCRL

An abstract interpretation toolkit for μCRL

A Bag-of-Tasks Approach for State Space Exploration Using Computational Grids

Equivalence Checking 40 Years After: A Review of Bisimulation Tools

Contact Info

Product

Resources

About