Q5009453 (Q5009453): Difference between revisions

@@ Property / cites work @@
+Comparing the Expressive Power of Well-Structured Transition Systems
+Normal rank
@@ Property / cites work @@
+On the Verification of Timed Ad Hoc Networks
@@ Property / cites work: On the Verification of Timed Ad Hoc Networks / rank @@
+Normal rank
@@ Property / cites work @@
+On the verification problem for weak memory models
+Normal rank
@@ Property / cites work @@
+What’s Decidable about Weak Memory Models?
@@ Property / cites work: What’s Decidable about Weak Memory Models? / rank @@
+Normal rank
@@ Property / cites work @@
+Q5367063
@@ Property / cites work: Q5367063 / rank @@
+Normal rank
@@ Property / cites work @@
+Handling infinitely branching well-structured transition systems
+Normal rank
@@ Property / cites work @@
+Q4251060
@@ Property / cites work: Q4251060 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Analysis of the Backward Coverability Algorithm for VASS
+Normal rank
@@ Property / cites work @@
+On Communicating Finite-State Machines
@@ Property / cites work: On Communicating Finite-State Machines / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q5111449
@@ Property / cites work: Q5111449 / rank @@
+Normal rank
@@ Property / cites work @@
+Separability of Reachability Sets of Vector Addition Systems
+Normal rank
@@ Property / cites work @@
+Soundness and Completeness of an Axiom System for Program Verification
+Normal rank
@@ Property / cites work @@
+Q5144625
@@ Property / cites work: Q5144625 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Separability of Regular Languages by Subsequences and Suffixes
+Normal rank
@@ Property / cites work @@
+On the coverability and reachability languages of monotonic extensions of Petri nets
+Normal rank
@@ Property / cites work @@
+Q4219024
@@ Property / cites work: Q4219024 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4247290
@@ Property / cites work: Q4247290 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3771630
@@ Property / cites work: Q3771630 / rank @@
+Normal rank
@@ Property / cites work @@
+Reduction and covering of infinite reachability trees
+Normal rank
@@ Property / cites work @@
+Q5389997
@@ Property / cites work: Q5389997 / 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 @@
+Well-structured transition systems everywhere!
@@ Property / cites work: Well-structured transition systems everywhere! / rank @@
+Normal rank
@@ Property / cites work @@
+Verification, Model Checking, and Abstract Interpretation
+Normal rank
@@ Property / cites work @@
+Q4249726
@@ Property / cites work: Q4249726 / rank @@
+Normal rank
@@ Property / cites work @@
+Expand, enlarge and check: new algorithms for the coverability problem of WSTS
+Normal rank
@@ Property / cites work @@
+Well-structured languages
@@ Property / cites work: Well-structured languages / rank @@
+Normal rank
@@ Property / cites work @@
+Nested interpolants
@@ Property / cites work: Nested interpolants / rank @@
+Normal rank
@@ Property / cites work @@
+On the Decidability of Grammar Problems
@@ Property / cites work: On the Decidability of Grammar Problems / rank @@
+Normal rank
@@ Property / cites work @@
+A note on well quasi-orderings for powersets
@@ Property / cites work: A note on well quasi-orderings for powersets / rank @@
+Normal rank
@@ Property / cites work @@
+Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
+Normal rank
@@ Property / cites work @@
+Une extension d'un théorème de P. Jullien sur les âges de mots
+Normal rank
@@ Property / cites work @@
+Invisible Pushdown Languages
@@ Property / cites work: Invisible Pushdown Languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q4344149
@@ Property / cites work: Q4344149 / rank @@
+Normal rank
@@ Property / cites work @@
+The ideal view on Rackoff's coverability technique
+Normal rank
@@ Property / cites work @@
+Demystifying Reachability in Vector Addition Systems
+Normal rank
@@ Property / cites work @@
+Foundations of BQO Theory
@@ Property / cites work: Foundations of BQO Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Networks of Timed Petri Nets
@@ Property / cites work: Dynamic Networks of Timed Petri Nets / rank @@
+Normal rank
@@ Property / cites work @@
+Undecidable problems in unreliable computations.
@@ Property / cites work: Undecidable problems in unreliable computations. / rank @@
+Normal rank
@@ Property / cites work @@
+Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages
+Normal rank
@@ Property / cites work @@
+Separating Regular Languages by Piecewise Testable and Unambiguous Languages
+Normal rank
@@ Property / cites work @@
+Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
+Normal rank
@@ Property / cites work @@
+Separating Regular Languages with First-Order Logic
+Normal rank
@@ Property / cites work @@
+Multiset rewriting for the verification of depth-bounded processes with name binding
+Normal rank
@@ Property / cites work @@
+Multiply-Recursive Upper Bounds with Higman’s Lemma
+Normal rank
@@ Property / cites work @@
+Noncanonical Extensions of Bottom-Up Parsing Techniques
+Normal rank
@@ Property / cites work @@
+Forward Analysis of Depth-Bounded Processes
@@ Property / cites work: Forward Analysis of Depth-Bounded Processes / rank @@
+Normal rank
@@ Property / cites work @@
+Antichains: A New Algorithm for Checking Universality of Finite Automata
+Normal rank