# Symbolic Reachability for Process Algebras with Recursive Data Types

@inproceedings{Blom2008SymbolicRF, title={Symbolic Reachability for Process Algebras with Recursive Data Types}, author={Stefan Blom and Jaco van de Pol}, booktitle={ICTAC}, year={2008} }

In this paper, we present a symbolic reachability algorithm for process algebras with recursive data types. Like the various saturation based algorithms of Ciardo et al, the algorithm is based on partitioning of the transition relation into events whose influence is local. As new features, our algorithm supports recursive data types and allows unbounded non-determinism, which is needed to support open systems with data. The algorithm does not use any specific features of process algebras. That…

## 43 Citations

Improving Reachability Analysis in Ltsmin

- Computer Science
- 2014

To improve symbolic reachability analysis in the model checking toolset LTSmin, two improvements to existing reachability algorithms are presented, which greatly speeds up state space generation for models such as Sokoban or dining philosophers.

A Parallel Construction of the Symbolic Observation Graph: the Basis for Efficient Model Checking of Concurrent Systems

- Computer ScienceSCSS
- 2017

An efficient multi-threaded algorithm for the construction of the so called Symbolic Observation Graph (SOG), a hybrid structure where the transitions of the system are divided into observed and unobserved ones, which outperforms the sequential method.

Parallel Symbolic Observation Graph

- Computer Science2017 IEEE International Symposium on Parallel and Distributed Processing with Applications and 2017 IEEE International Conference on Ubiquitous Computing and Communications (ISPA/IUCC)
- 2017

This paper aims at improving the performances of the so called Symbolic Observation Graph (SOG) construction by using parallelization techniques and proposes two parallel algorithms to build the SOG.

Efficient learning and analysis of system behavior

- Computer Science
- 2019

Improved learning algorithm that is able to deal with huge alphabets and bandwidth reduction techniques, originally designed for sparse matrix solvers, are very capable at reducing the memory footprint of the specifications' symbolic state space.

LTSmin: High-Performance Language-Independent Model Checking

- Computer ScienceTACAS
- 2015

An overview of the LTSmin model checker toolset and its recent changes is presented, and its performance and versatility is demonstrated in two case studies.

Symbolic Reachability Analysis of B Through ProB and LTSmin

- Computer ScienceIFM
- 2016

A new scalable, symbolic analysis algorithm for the B-Method and Event-B, along with a platform to integrate other model checking improvements via LTSmin in the future is provided.

A linear process-algebraic format with data for probabilistic automata

- Computer ScienceTheor. Comput. Sci.
- 2012

Symbolic model checking of timed automata using LTSmin

- Computer Science
- 2016

A basic model checker is created, on which extensions and improvements can be built to create a modelChecker that can compete with other state of the art tools these improvements are needed.

Saturation for LTSmin

- Computer Science
- 2012

The main goal of this Master project is to design and implement the aforementioned Saturation-based approach in the LTSmin toolset, which is a set of verification tools developed by the Formal Methods and Tools group (FMT) at the University of Twente.

Reducing Time and/or Memory Consumption of the SOG Construction in a Parallel Context

- Computer Science2018 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Ubiquitous Computing & Communications, Big Data & Cloud Computing, Social Computing & Networking, Sustainable Computing & Communications (ISPA/IUCC/BDCloud/SocialCom/SustainCom)
- 2018

This paper proposes a Multi-valued decision diagrams (MDDs) based algorithm to determine a single representative for each strongly connected component in every aggregate allowing to remove from memory a consequent number of states which are no more necessary for the construction process.

## References

SHOWING 1-10 OF 28 REFERENCES

Saturation-Based Symbolic Reachability Analysis Using Conjunctive and Disjunctive Partitioning

- Computer ScienceCHARME
- 2005

A new saturation-based symbolic state-space generation algorithm for finite discrete-state systems, based on the structure of the high-level model specification, which can now be applied to completely general asynchronous systems, while requiring similar or better run-times and peak memory than previous saturation algorithms.

µCRL: A Toolset for Analysing Algebraic Specifications

- Computer ScienceCAV
- 2001

µCRL [13] is a language for specifying and verifying distributed systems in an algebraic fashion. It targets the specification of system behaviour in a process-algebraic style and of data elements in…

SMART: the stochastic model checking analyzer for reliability and timing

- Computer ScienceFirst International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings.
- 2004

While initially designed as a powerful stochastic environment integrating multiple modeling formalisms, SMART now includes logical analysis and employs some of the most efficient data structures and algorithms for the analysis of discrete-state systems.

New developments around the mCRL tool set

- Computer ScienceElectron. Notes Theor. Comput. Sci.
- 2003

The saturation algorithm for symbolic state-space exploration

- Computer ScienceInternational Journal on Software Tools for Technology Transfer
- 2005

We present various algorithms for generating the state space of an asynchronous system based on the use of multiway decision diagrams to encode sets and Kronecker operators on boolean matrices to…

The Theory and Practice of Concurrency

- Computer Science
- 1997

This book provides a detailed foundation for working with CSP, using as little mathematics as possible, and introduces the ideas behind operational, denotational and algebraic models of CSP.

A parallel algorithm for constructing binary decision diagrams

- Computer ScienceProceedings., 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors
- 1990

A parallel algorithm for constructing binary decision diagrams is described, designed so that it is possible to find the minimal representations for several Boolean operations in parallel.

Graph-Based Algorithms for Boolean Function Manipulation

- Computer ScienceIEEE Transactions on Computers
- 1986

Experimental results from applying a new data structure for representing Boolean functions and an associated set of manipulation algorithms to problems in logic design verification demonstrate the practicality of this approach.

Deriving Symbolic Representations from Stochastic Process Algebras

- Computer SciencePAPM-PROBMIV
- 2002

A new denotational semantics for a variant of the stochastic process algebra TIPP is presented, which maps process terms to Multiterminal binary decision diagrams. It is shown that the new semantics…

Model checking a cache coherence protocol for a Java DSM implementation

- Computer ScienceProceedings International Parallel and Distributed Processing Symposium
- 2003

This paper reports on the analysis of the Jackal protocol, a fine-grained distributed shared memory implementation of the Java programming language that employs a multiple-writer cache coherence protocol.