Symbolic Reachability for Process Algebras with Recursive Data Types

DOI10.1007/978-3-540-85762-4_6zbMath1161.68613OpenAlexW1670747209WikidataQ62047487 ScholiaQ62047487MaRDI QIDQ5505595

Jaco van de Pol, Stefan Blom

Publication date: 27 January 2009

Published in: Theoretical Aspects of Computing - ICTAC 2008 (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/symbolic-reachability-for-process-algebras-with-recursive-data-types(aeb54cdd-d5b2-48b3-83cf-4a7222749107).html

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

A decision diagram operation for reachability ⋮ A linear process-algebraic format with data for probabilistic automata ⋮ State Space Reduction of Linear Processes Using Control Flow Reconstruction

Uses Software

• E-LOTOS
• ATERM
• CADP

Cites Work

• Unnamed Item
• Unnamed Item
• Model checking a cache coherence protocol of a Java DSM implementation
• Verification of the link layer protocol of the IEEE-1394 serial bus (FireWire): An experiment with E-LOTOS
• Verification of a sliding window protocol in \(\mu\) CRL and PVS
• A Database Approach to Distributed State Space Generation
• On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
• Graph-Based Algorithms for Boolean Function Manipulation
• Correct Hardware Design and Verification Methods

This page was built for publication: Symbolic Reachability for Process Algebras with Recursive Data Types