Forward analysis for WSTS. III: Karp-Miller trees
From MaRDI portal
Publication:5136306
DOI10.4230/LIPICS.FSTTCS.2017.16zbMATH Open1491.68118MaRDI QIDQ5136306FDOQ5136306
Michael Blondin, Alain Finkel, Jean Goubault-Larrecq
Publication date: 25 November 2020
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Theory of relations. Transl. from the French by P. Clote
- On Context-Free Languages
- Reduction and covering of infinite reachability trees
- A well-structured framework for analysing Petri net extensions
- Algorithmic analysis of programs with well quasi-ordered domains.
- Computable fixpoints in well-structured symbolic model checking
- Expand, enlarge and check: new algorithms for the coverability problem of WSTS
- Forward analysis and model checking for trace bounded WSTS
- Lossy Counter Machines Decidability Cheat Sheet
- Forward Analysis for WSTS, Part II: Complete WSTS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Well-structured transition systems everywhere!
- Undecidable verification problems for programs with unreliable channels
- Title not available (Why is that?)
- The residue of vector sets with applications to decidability problems in Petri nets
- On families of mutually exclusive sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rélations non reconstructibles par leurs restrictions
- Coverability Trees for Petri Nets with Unordered Data
- Multiset rewriting for the verification of depth-bounded processes with name binding
- Title not available (Why is that?)
- Dimension de Krull des ensembles ordonnés. (Krull dimension of ordered sets)
- Title not available (Why is that?)
- Bounds on Mobility
- Ordered sets with no infinite antichains
- Ideal Abstractions for Well-Structured Transition Systems
- On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems
- Recursive Petri nets
- Handling Infinitely Branching WSTS
- \(\omega\)-Petri nets: algorithms and complexity
- Title not available (Why is that?)
- Forward Analysis and Model Checking for Trace Bounded WSTS
Cited In (5)
- Forward analysis for WSTS, part I: completions
- Parameterized verification of coverability in infinite state broadcast networks
- Title not available (Why is that?)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Expand, enlarge and check: new algorithms for the coverability problem of WSTS
This page was built for publication: Forward analysis for WSTS. III: Karp-Miller trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136306)
