Forward analysis and model checking for trace bounded WSTS (Q290914): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2016.04.020
@@ Property / DOI: 10.1016/j.tcs.2016.04.020 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+TREX
@@ Property / describes a project that uses: TREX / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+LASH
@@ Property / describes a project that uses: LASH / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+ALGOL 60
@@ Property / describes a project that uses: ALGOL 60 / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+FAST
@@ Property / describes a project that uses: FAST / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2016.04.020
+Normal rank
@@ Property / OpenAlex ID @@
+W2337536205
@@ Property / OpenAlex ID: W2337536205 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded Algol-Like Languages
@@ Property / cites work: Bounded Algol-Like Languages / rank @@
+Normal rank
@@ Property / cites work @@
+Forward Analysis for WSTS, Part II: Complete WSTS
@@ Property / cites work: Forward Analysis for WSTS, Part II: Complete WSTS / rank @@
+Normal rank
@@ Property / cites work @@
+Automated Technology for Verification and Analysis
+Normal rank
@@ Property / cites work @@
+Q4551165
@@ Property / cites work: Q4551165 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic analysis of programs with well quasi-ordered domains.
+Normal rank
@@ Property / cites work @@
+From pre-historic to post-modern symbolic model checking
+Normal rank
@@ Property / cites work @@
+Verifying programs with unreliable channels
@@ Property / cites work: Verifying programs with unreliable channels / rank @@
+Normal rank
@@ Property / cites work @@
+CONCUR 2004 - Concurrency Theory
@@ Property / cites work: CONCUR 2004 - Concurrency Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Automated Technology for Verification and Analysis
+Normal rank
@@ Property / cites work @@
+Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete
+Normal rank
@@ Property / cites work @@
+Q5389997
@@ Property / cites work: Q5389997 / rank @@
+Normal rank
@@ Property / cites work @@
+Expand, enlarge and check: new algorithms for the coverability problem of WSTS
+Normal rank
@@ Property / cites work @@
+Parallel program schemata
@@ Property / cites work: Parallel program schemata / rank @@
+Normal rank
@@ Property / cites work @@
+Reduction and covering of infinite reachability trees
+Normal rank
@@ Property / cites work @@
+Model-checking CTL* over flat Presburger counter systems
+Normal rank
@@ Property / cites work @@
+Taming past LTL and flat counter systems
@@ Property / cites work: Taming past LTL and flat counter systems / rank @@
+Normal rank
@@ Property / cites work @@
+Interprocedural Reachability for Flat Integer Programs
+Normal rank
@@ Property / cites work @@
+A Characterization of Semilinear Sets
@@ Property / cites work: A Characterization of Semilinear Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Mixing Lossy and Perfect Fifo Channels
@@ Property / cites work: Mixing Lossy and Perfect Fifo Channels / rank @@
+Normal rank
@@ Property / cites work @@
+Model Checking Coverability Graphs of Vector Addition Systems
+Normal rank
@@ Property / cites work @@
+Undecidable verification problems for programs with unreliable channels
+Normal rank
@@ Property / cites work @@
+Undecidable problems in unreliable computations.
@@ Property / cites work: Undecidable problems in unreliable computations. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4936148
@@ Property / cites work: Q4936148 / rank @@
+Normal rank
@@ Property / cites work @@
+Using forward reachability analysis for verification of lossy channel systems
+Normal rank
@@ Property / cites work @@
+Decidability of model checking for infinite-state concurrent systems
+Normal rank
@@ Property / cites work @@
+About the decision of reachability for register machines
+Normal rank
@@ Property / cites work @@
+Q4938633
@@ Property / cites work: Q4938633 / rank @@
+Normal rank
@@ Property / cites work @@
+Well-structured transition systems everywhere!
@@ Property / cites work: Well-structured transition systems everywhere! / rank @@
+Normal rank
@@ Property / cites work @@
+Well-structured languages
@@ Property / cites work: Well-structured languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q5590814
@@ Property / cites work: Q5590814 / rank @@
+Normal rank
@@ Property / cites work @@
+A well-structured framework for analysing Petri net extensions
+Normal rank
@@ Property / cites work @@
+Lossy Counter Machines Decidability Cheat Sheet
@@ Property / cites work: Lossy Counter Machines Decidability Cheat Sheet / rank @@
+Normal rank
@@ Property / cites work @@
+Q4415251
@@ Property / cites work: Q4415251 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4219024
@@ Property / cites work: Q4219024 / rank @@
+Normal rank
@@ Property / cites work @@
+ON YEN'S PATH LOGIC FOR PETRI NETS
@@ Property / cites work: ON YEN'S PATH LOGIC FOR PETRI NETS / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Hierarchies beyond Elementary
@@ Property / cites work: Complexity Hierarchies beyond Elementary / rank @@
+Normal rank
@@ Property / cites work @@
+Hierarchies of number-theoretic functions. I
@@ Property / cites work: Hierarchies of number-theoretic functions. I / rank @@
+Normal rank
@@ Property / cites work @@
+Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
+Normal rank
@@ Property / cites work @@
+Q4152749
@@ Property / cites work: Q4152749 / rank @@
+Normal rank
@@ Property / cites work @@
+The covering and boundedness problems for vector addition systems
+Normal rank
@@ Property / cites work @@
+Q4247290
@@ Property / cites work: Q4247290 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3766867
@@ Property / cites work: Q3766867 / rank @@
+Normal rank
@@ Property / cites work @@
+FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME
+Normal rank
@@ Property / cites work @@
+Multiply-Recursive Upper Bounds with Higman’s Lemma
+Normal rank
@@ Property / cites work @@
+Q2753678
@@ Property / cites work: Q2753678 / rank @@
+Normal rank
@@ Property / cites work @@
+Computable fixpoints in well-structured symbolic model checking
+Normal rank
@@ Property / cites work @@
+Rational and recognizable complex trace languages
@@ Property / cites work: Rational and recognizable complex trace languages / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages
+Normal rank
@@ Property / cites work @@
+On Communicating Finite-State Machines
@@ Property / cites work: On Communicating Finite-State Machines / rank @@
+Normal rank
@@ Property / cites work @@
+Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
+Normal rank
@@ Property / cites work @@
+Bounded underapproximations
@@ Property / cites work: Bounded underapproximations / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2016.04.020
@@ Property / DOI: 10.1016/J.TCS.2016.04.020 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:290914