Forward Analysis of Depth-Bounded Processes

DOI10.1007/978-3-642-12032-9_8zbMath1284.68419OpenAlexW1504065323MaRDI QIDQ3557846

Thomas Wies, Damien Zufferey, Thomas A. Henzinger

Publication date: 27 April 2010

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12032-9_8

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (11)

Ideal Abstractions for Well-Structured Transition Systems ⋮ Model Checking Concurrent Programs ⋮ Petri Nets with Structured Data ⋮ Liveness in broadcast networks ⋮ Handling infinitely branching well-structured transition systems ⋮ Unnamed Item ⋮ Using session types for reasoning about boundedness in the \(\pi\)-calculus ⋮ Multiset rewriting for the verification of depth-bounded processes with name binding ⋮ Unnamed Item ⋮ On Hierarchical Communication Topologies in the $$\pi $$ -calculus ⋮ Forward analysis for WSTS, part I: completions

This page was built for publication: Forward Analysis of Depth-Bounded Processes