The Theory of WSTS: The Case of Complete WSTS

DOI10.1007/978-3-642-31131-4_2zbMATH Open1357.68135OpenAlexW52114703MaRDI QIDQ2908196FDOQ2908196

Authors: Jean Goubault-Larrecq, Alain Finkel 

Publication date: 4 September 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-31131-4_2

Recommendations

• The ideal theory for WSTS
• Forward Analysis for WSTS, Part II: Complete WSTS
• Forward analysis for WSTS. II: Complete WSTS
• Forward analysis for WSTS. I: Completions
• Forward analysis for WSTS, part I: completions
• Worst-case expansions of complete theories
• Verification, Model Checking, and Abstract Interpretation
• scientific article; zbMATH DE number 1506503
• scientific article; zbMATH DE number 1367673
• The Wulff theorem revisited

zbMATH Keywords

well-structured transition systems

Mathematics Subject Classification ID

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

Cited In (7)

• Forward Analysis for WSTS, Part II: Complete WSTS
• Forward analysis for WSTS, part I: completions
• Forward analysis for WSTS. III: Karp-Miller trees
• Forward analysis for WSTS. III: Karp-Miller trees
• Forward analysis for WSTS. I: Completions
• The ideal theory for WSTS
• Forward analysis for WSTS. II: Complete WSTS

This page was built for publication: The Theory of WSTS: The Case of Complete WSTS

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