Pages that link to "Item:Q1854355"
From MaRDI portal
The following pages link to Algorithmic analysis of programs with well quasi-ordered domains. (Q1854355):
Displaying 47 items.
- Forward analysis and model checking for trace bounded WSTS (Q290914) (← links)
- Deciding safety properties in infinite-state pi-calculus via behavioural types (Q418155) (← links)
- Ordinal recursive complexity of unordered data nets (Q529043) (← links)
- Decidability and complexity of Petri nets with unordered data (Q554219) (← links)
- Multiset rewriting for the verification of depth-bounded processes with name binding (Q714507) (← links)
- Deciding branching time properties for asynchronous programs (Q732003) (← links)
- Reachability problems on reliable and lossy queue automata (Q825976) (← links)
- Approximated parameterized verification of infinite-state processes with global conditions (Q1039841) (← links)
- Handling infinitely branching well-structured transition systems (Q1686118) (← links)
- Verifying lossy channel systems has nonprimitive recursive complexity. (Q1853078) (← links)
- Model checking of systems with many identical timed processes (Q1853589) (← links)
- Exponential improvement of time complexity of model checking for multiagent systems with perfect recall (Q1938921) (← links)
- On termination and invariance for faulty channel machines (Q1941874) (← links)
- Branch-well-structured transition systems and extensions (Q2165211) (← links)
- Run-time complexity bounds using squeezers (Q2233463) (← links)
- Computable fixpoints in well-structured symbolic model checking (Q2248074) (← links)
- Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable (Q2317836) (← links)
- A general approach to comparing infinite-state systems with their finite-state specifications (Q2503044) (← links)
- Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols (Q2643568) (← links)
- Coverability Trees for Petri Nets with Unordered Data (Q2811357) (← links)
- Complexity Hierarchies beyond Elementary (Q2828216) (← links)
- On the Expressiveness of Mobile Synchronizing Petri Nets (Q2864393) (← 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)
- Well (and Better) Quasi-Ordered Transition Systems (Q3067860) (← links)
- The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings (Q3295146) (← links)
- Forward analysis for WSTS, part I: completions (Q3386750) (← links)
- Monotonic Abstraction for Programs with Dynamic Memory Heaps (Q3512503) (← links)
- When Is Reachability Intrinsically Decidable? (Q3533013) (← links)
- Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication (Q3636840) (← links)
- Universal safety for timed Petri nets is PSPACE-complete (Q5009418) (← links)
- (Q5020648) (← links)
- The Parametric Complexity of Lossy Counter Machines (Q5092331) (← links)
- (Q5114831) (← links)
- (Q5136306) (← links)
- Dynamic Networks of Timed Petri Nets (Q5166770) (← links)
- (Q5207052) (← links)
- Handling Parameterized Systems with Non-atomic Global Conditions (Q5452704) (← links)
- Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols (Q5458318) (← links)
- Monotonic Abstraction in Action (Q5505593) (← links)
- Hardness Results for Coverability Problem of Well-Structured Pushdown Systems (Q5739016) (← links)
- Occam's razor applied to the Petri net coverability problem (Q5915567) (← links)
- Clique-width and well-quasi-ordering of triangle-free graph classes (Q5918202) (← links)
- The ideal view on Rackoff's coverability technique (Q5925512) (← links)
- Well-structured transition systems everywhere! (Q5941101) (← links)
