Pages that link to "Item:Q5941101"
From MaRDI portal
The following pages link to Well-structured transition systems everywhere! (Q5941101):
Displayed 50 items.
- WQO is decidable for factorial languages (Q2407108) (← links)
- Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes (Q2407982) (← links)
- Quantitative analysis of probabilistic lossy channel systems (Q2495651) (← links)
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata (Q2496297) (← links)
- A general approach to comparing infinite-state systems with their finite-state specifications (Q2503044) (← links)
- Expand, enlarge and check: new algorithms for the coverability problem of WSTS (Q2581762) (← links)
- Well-structured languages (Q2641880) (← links)
- Learning to verify branching time properties (Q2642669) (← links)
- Alternating complexity of counting first-order logic for the subword order (Q2687036) (← links)
- Population protocols: beyond runtime analysis (Q2695486) (← links)
- Weak and Nested Class Memory Automata (Q2799172) (← links)
- On Hierarchical Communication Topologies in the $$\pi $$ -calculus (Q2802475) (← links)
- Coverability Trees for Petri Nets with Unordered Data (Q2811357) (← links)
- Unbounded-Thread Program Verification using Thread-State Equations (Q2817949) (← links)
- Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes (Q2819509) (← links)
- Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture (Q2822649) (← links)
- Decidable Classes of Unbounded Petri Nets with Time and Urgency (Q2822660) (← links)
- Well-quasi-ordering Does Not Imply Bounded Clique-width (Q2827822) (← links)
- Complexity Hierarchies beyond Elementary (Q2828216) (← links)
- (Q2842877) (← links)
- Well-quasi-ordering hereditarily finite sets (Q2855754) (← links)
- Expressiveness Issues in Brane Calculi: A Survey (Q2870193) (← links)
- Narrowing and Rewriting Logic: from Foundations to Applications (Q2873786) (← links)
- Ideal Abstractions for Well-Structured Transition Systems (Q2891435) (← links)
- Petri Nets with Structured Data (Q2941152) (← links)
- Complete Abstractions and Subclassical Modal Logics (Q2961561) (← links)
- Deciding Structural Liveness of Petri Nets (Q2971127) (← links)
- Forward Analysis and Model Checking for Trace Bounded WSTS (Q3011881) (← links)
- Multiply-Recursive Upper Bounds with Higman’s Lemma (Q3012939) (← links)
- AUTOMATIC VERIFICATION OF DIRECTORY-BASED CONSISTENCY PROTOCOLS WITH GRAPH CONSTRAINTS (Q3016215) (← links)
- Well (and Better) Quasi-Ordered Transition Systems (Q3067860) (← links)
- Verification of Timed-Arc Petri Nets (Q3075507) (← links)
- (Q3130550) (← links)
- Model Checking Parameterized Systems (Q3176379) (← links)
- Symbolic Model Checking in Non-Boolean Domains (Q3176389) (← links)
- The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings (Q3295146) (← links)
- Theories of orders on the set of words (Q3374756) (← links)
- (Q3384884) (← links)
- Forward analysis for WSTS, part I: completions (Q3386750) (← links)
- The Reachability Problem over Infinite Graphs (Q3392937) (← links)
- Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems (Q3512494) (← links)
- Monotonic Abstraction for Programs with Dynamic Memory Heaps (Q3512503) (← links)
- Tree Pattern Rewriting Systems (Q3540083) (← links)
- Discovery, Verification and Conformance of Workflows with Cancellation (Q3540385) (← links)
- On the Reachability Analysis of Acyclic Networks of Pushdown Systems (Q3541030) (← links)
- Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets (Q3543285) (← links)
- A Biologically Inspired Model with Fusion and Clonation of Membranes (Q3543334) (← links)
- Decidability properties for fragments of CHR (Q3585171) (← links)
- Event-Clock Visibly Pushdown Automata (Q3599103) (← links)
- A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations (Q3618568) (← links)