The following pages link to (Q4938633):
Displaying 13 items.
- Forward analysis and model checking for trace bounded WSTS (Q290914) (← links)
- On selective unboundedness of VASS (Q355513) (← links)
- Soundness of workflow nets: classification, decidability, and analysis (Q539433) (← links)
- Decidability and complexity of Petri nets with unordered data (Q554219) (← links)
- Reduction rules for reset/inhibitor nets (Q847264) (← links)
- Soundness-preserving reduction rules for reset workflow nets (Q1007883) (← links)
- Undecidable problems in unreliable computations. (Q1401309) (← links)
- Handling infinitely branching well-structured transition systems (Q1686118) (← links)
- Verifying lossy channel systems has nonprimitive recursive complexity. (Q1853078) (← links)
- On the Termination of Integer Loops (Q2891402) (← links)
- Forward Analysis and Model Checking for Trace Bounded WSTS (Q3011881) (← links)
- Discovery, Verification and Conformance of Workflows with Cancellation (Q3540385) (← links)
- (Q5090970) (← links)
