The following pages link to Well-structured languages (Q2641880):
Displaying 12 items.
- Forward analysis and model checking for trace bounded WSTS (Q290914) (← links)
- A classification of the expressive power of well-structured transition systems (Q553290) (← links)
- General decidability results for asynchronous shared-memory programs: higher-order and beyond (Q2044219) (← links)
- On Boolean closed full trios and rational Kripke frames (Q2363961) (← links)
- Forward Analysis and Model Checking for Trace Bounded WSTS (Q3011881) (← links)
- On the Efficient Computation of the Minimal Coverability Set for Petri Nets (Q3510790) (← links)
- A Biologically Inspired Model with Fusion and Clonation of Membranes (Q3543334) (← links)
- A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations (Q3618568) (← links)
- Unboundedness Problems for Languages of Vector Addition Systems. (Q5002804) (← links)
- (Q5009453) (← links)
- Coverability, Termination, and Finiteness in Recursive Petri Nets (Q5025058) (← links)
- General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond (Q5060187) (← links)
