Forward analysis of depth-bounded processes

DOI10.1007/978-3-642-12032-9_8MaRDI QIDQ3557846zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Bounds on mobility
• Forward analysis and model checking for trace bounded WSTS
• Forward analysis and model checking for trace bounded WSTS
• A theory of name boundedness
• Using session types for reasoning about boundedness in the \(\pi\)-calculus

Cited in

(12)

• Handling infinitely branching well-structured transition systems
• Using session types for reasoning about boundedness in the \(\pi\)-calculus
• Liveness in broadcast networks
• On hierarchical communication topologies in the -calculus
• Ideal abstractions for well-structured transition systems
• Petri nets with structured data
• Model checking concurrent programs
• Bounds on mobility
• Forward analysis for WSTS, part I: completions
• Regular separability of well-structured transition systems
• scientific article; zbMATH DE number 7559487 (Why is no real title available?)
• Multiset rewriting for the verification of depth-bounded processes with name binding

This page was built for publication: Forward analysis of depth-bounded processes

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