Forward analysis for WSTS. III: Karp-Miller trees
From MaRDI portal
(Redirected from Publication:5114831)
Forward analysis for WSTS. III: Karp-Miller trees (scientific article; zbMATH DE number 7215292)
Forward analysis for WSTS. III: Karp-Miller trees (scientific article; zbMATH DE number 7215292)
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 1392309 (Why is no real title available?)
- scientific article; zbMATH DE number 1456956 (Why is no real title available?)
- scientific article; zbMATH DE number 5194318 (Why is no real title available?)
- scientific article; zbMATH DE number 6790161 (Why is no real title available?)
- A constructive proof of the topological Kruskal theorem
- A unified approach for deciding the existence of certain petri net paths
- 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
- Dimension de Krull des ensembles ordonnés. (Krull dimension of ordered sets)
- Extending the Rackoff technique to affine nets
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Forward Analysis for WSTS, Part II: Complete WSTS
- Forward analysis and model checking for trace bounded WSTS
- Forward analysis for WSTS. I: Completions
- Forward analysis for WSTS. II: Complete WSTS
- Handling infinitely branching 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 YEN'S PATH LOGIC FOR PETRI NETS
- 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
- On the complexity of the linear-time μ-calculus for Petri Nets
- Ordered sets with no infinite antichains
- Recursive Petri nets
- Reduction and covering of infinite reachability trees
- Reverse mathematics and initial intervals
- 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
- Une extension d'un théorème de P. Jullien sur les âges de mots
- Using forward reachability analysis for verification of lossy channel systems
- Well-structured transition systems everywhere!
- -Petri nets: algorithms and complexity
Cited in
(10)- 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
- Forward analysis for WSTS. III: Karp-Miller trees
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Commodification of accelerations for the Karp and Miller construction
- Statures and sobrification ranks of Noetherian spaces
- 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 Q5114831)
