Forward analysis for WSTS. III: Karp-Miller trees
From MaRDI portal
(Redirected from Publication:5136306)
Recommendations
Cites work
- scientific article; zbMATH DE number 3646295 (Why is no real title available?)
- scientific article; zbMATH DE number 4030997 (Why is no real title available?)
- scientific article; zbMATH DE number 3501550 (Why is no real title available?)
- scientific article; zbMATH DE number 1223710 (Why is no real title available?)
- scientific article; zbMATH DE number 1392309 (Why is no real title available?)
- scientific article; zbMATH DE number 1456956 (Why is no real title available?)
- scientific article; zbMATH DE number 6790161 (Why is no real title available?)
- A well-structured framework for analysing Petri net extensions
- Accelerations for the coverability set of Petri nets with names
- Algorithmic analysis of programs with well quasi-ordered domains.
- Bounds on mobility
- Computable fixpoints in well-structured symbolic model checking
- Coverability trees for Petri nets with unordered data
- Dimension de Krull des ensembles ordonnés. (Krull dimension of ordered sets)
- Expand, enlarge and check: new algorithms for the coverability problem of WSTS
- Forward Analysis for WSTS, Part II: Complete WSTS
- Forward analysis and model checking for trace bounded WSTS
- Forward analysis and model checking for trace bounded WSTS
- Forward analysis for WSTS. I: Completions
- Handling infinitely branching WSTS
- Ideal abstractions for well-structured transition systems
- Karp-Miller trees for a branching extension of VASS
- Lossy counter machines decidability cheat sheet
- Multiset rewriting for the verification of depth-bounded processes with name binding
- On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems
- On Context-Free Languages
- On families of mutually exclusive sets
- Ordered sets with no infinite antichains
- Recursive Petri nets
- Reduction and covering of infinite reachability trees
- Rélations non reconstructibles par leurs restrictions
- The residue of vector sets with applications to decidability problems in Petri nets
- Theory of relations. Transl. from the French by P. Clote
- Undecidable verification problems for programs with unreliable channels
- Well-structured transition systems everywhere!
- -Petri nets: algorithms and complexity
Cited in
(11)- Forward Analysis for WSTS, Part II: Complete WSTS
- Forward analysis and model checking for trace bounded WSTS
- Forward analysis and model checking for trace bounded WSTS
- Forward analysis for WSTS, part I: completions
- Parameterized verification of coverability in infinite state broadcast networks
- Forward analysis for WSTS. III: Karp-Miller trees
- scientific article; zbMATH DE number 7453189 (Why is no real title available?)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Directed regular and context-free languages
- Expand, enlarge and check: new algorithms for the coverability problem of WSTS
- Forward analysis for WSTS. II: Complete 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)
