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… 
Improving Reachability Analysis in Ltsmin
TLDR
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
TLDR
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
  • Hiba Ouni, K. Klai, C. A. Abid, Belhassen Zouari
  • Computer Science
    2017 IEEE International Symposium on Parallel and Distributed Processing with Applications and 2017 IEEE International Conference on Ubiquitous Computing and Communications (ISPA/IUCC)
  • 2017
TLDR
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
TLDR
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
TLDR
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
TLDR
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.
Bridging the Gap between Enumerative and Symbolic Model Checkers
TLDR
The method proposed significantly reduces the complexity of building modular yet still efficient model checking tools by match or even outperform existing tools by reusing their own state generators, which are linked into an implementation of the ideas.
A linear process-algebraic format with data for probabilistic automata
Symbolic model checking of timed automata using LTSmin
TLDR
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
TLDR
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.
...
...

References

SHOWING 1-10 OF 27 REFERENCES
Saturation-Based Symbolic Reachability Analysis Using Conjunctive and Disjunctive Partitioning
TLDR
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
µ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
New developments around the mCRL tool set
The saturation algorithm for symbolic state-space exploration
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
TLDR
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.
An Embeddable Virtual Machine for State Space Generation
The semantics of modelling languages are not always specified in a precise and formal way, and their rather complex underlying models make it a non-trivial exercise to reuse them in newly developed
A parallel algorithm for constructing binary decision diagrams
  • S. Kimura, E. Clarke
  • Computer Science
    Proceedings., 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors
  • 1990
TLDR
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
  • R. Bryant
  • Computer Science
    IEEE Transactions on Computers
  • 1986
TLDR
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
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
...
...