Pages that link to "Item:Q1323345"
From MaRDI portal
The following pages link to Proving finiteness of CCS processes by non-standard semantics (Q1323345):
Displaying 5 items.
- Template iterations with non-definable ccc forcing notions (Q490863) (← links)
- GSOS and finite labelled transition systems (Q1331924) (← links)
- Finite approximations for model checking non-finite-state processes (Q2747754) (← links)
- The Decidability of the Reachability Problem for CCS! (Q3090842) (← links)
- Predicatively unprovable termination of the Ackermannian Goodstein process (Q5113418) (← links)