Reachability for Dynamic Parametric Processes

DOI10.1007/978-3-319-52234-0_23zbMath1484.68143arXiv1609.05385OpenAlexW2522644249MaRDI QIDQ2961580

Helmut Seidl, Igor Walukiewicz, Anca Muscholl

Publication date: 21 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.05385

Mathematics Subject Classification ID

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

Uses Software

• Program-Conflict-Analysis

Cites Work

• Parameterised Pushdown Systems with Non-Atomic Writes
• Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation
• Conflict Analysis of Programs with Procedures, Dynamic Thread Creation, and Monitors
• Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
• Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable
• Collapsible Pushdown Automata and Recursion Schemes
• Computer Aided Verification
• Reachability under Contextual Locking
• Model checking parameterized asynchronous shared-memory systems
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Reachability for Dynamic Parametric Processes