Symbolic Reachability for Process Algebras with Recursive Data Types

DOI10.1007/978-3-540-85762-4_6zbMATH Open1161.68613DBLPconf/ictac/BlomP08OpenAlexW1670747209WikidataQ62047487 ScholiaQ62047487MaRDI QIDQ5505595FDOQ5505595

Authors: Stefan Blom, Jaco van de Pol 

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

Recommendations

• Reachability for finite-state process algebras using static analysis
• Reachability for finite-state process algebras using Horn clauses
• A symbolic approach to value-passing processes
• A logical reconstruction of reachability
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Graph-Based Algorithms for Boolean Function Manipulation
• On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
• Verification of a sliding window protocol in \(\mu\) CRL and PVS
• 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
• Correct Hardware Design and Verification Methods
• A database approach to distributed state space generation
• Title not available (Why is that?)

Cited In (7)

• State space reduction of linear processes using control flow reconstruction
• Title not available (Why is that?)
• Simplifying process parameters by unfolding algebraic data types
• A linear process-algebraic format with data for probabilistic automata
• Reachability for finite-state process algebras using static analysis
• Reachability for finite-state process algebras using Horn clauses
• A decision diagram operation for reachability

Uses Software

• E-LOTOS
• ATERM
• CADP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505595)