The following pages link to (Q4152749):
Displaying 34 items.
- Forward analysis and model checking for trace bounded WSTS (Q290914) (← links)
- On selective unboundedness of VASS (Q355513) (← links)
- Proving nonreachability by modulo-invariants (Q672866) (← links)
- Properties of congruences on commutative monoids (Q799821) (← links)
- Complexity of the word problem for commutative semigroups of fixed dimension (Q802020) (← links)
- Complexity of certain decision problems about congruential languages (Q1085618) (← links)
- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states (Q1096388) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- Completeness results for conflict-free vector replacement systems (Q1113674) (← links)
- New decision algorithms for finitely presented commutative semigroups (Q1147232) (← links)
- The complexity of problems involving structurally bounded and conservative Petri nets (Q1183417) (← links)
- Normal and sinkless Petri nets (Q1208921) (← links)
- The covering and boundedness problems for vector addition systems (Q1242682) (← links)
- On polynomial time isomorphisms of some new complete sets (Q1245571) (← links)
- Speed faults in computation by chemical reaction networks (Q1689751) (← links)
- The complexity of the word problems for commutative semigroups and polynomial ideals (Q1836661) (← links)
- Composable computation in discrete chemical reaction networks (Q2064055) (← links)
- Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable (Q2317836) (← links)
- Some complexity results for stateful network verification (Q2335903) (← links)
- Verification of gap-order constraint abstractions of counter systems (Q2435309) (← links)
- Coverability Trees for Petri Nets with Unordered Data (Q2811357) (← links)
- Unbounded-Thread Program Verification using Thread-State Equations (Q2817949) (← links)
- Ratio and Weight Quantiles (Q2946351) (← links)
- A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups (Q2975255) (← links)
- Forward Analysis and Model Checking for Trace Bounded WSTS (Q3011881) (← links)
- Vector Addition System Reversible Reachability Problem (Q3090839) (← links)
- (Q3885224) (← links)
- On polynomial ideals, their complexity, and applications (Q5055880) (← links)
- (Q5111645) (← links)
- (Q5129948) (← links)
- A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application (Q5166771) (← links)
- Computing with chemical reaction networks: a tutorial (Q6150974) (← links)
- Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations (Q6487345) (← links)
- The complexity of soundness in workflow nets (Q6649450) (← links)
