The following pages link to (Q4222997):
Displaying 14 items.
- A partial ordering semantics for CCS (Q914400) (← links)
- Proving finiteness of CCS processes by non-standard semantics (Q1323345) (← links)
- Presheaf models for CCS-like languages (Q1399958) (← links)
- A causal semantics for CCS via rewriting logic (Q1606128) (← links)
- Maude: specification and programming in rewriting logic (Q1608917) (← links)
- Rewriting logic: Roadmap and bibliography (Q1615001) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- Concurrencies in reversible concurrent calculi (Q2097423) (← links)
- An interpretation of CCS into ludics (Q2333316) (← links)
- Executable structural operational semantics in Maude (Q2369036) (← links)
- A compositional proof system on a category of labelled transition systems (Q2640340) (← links)
- The Decidability of the Reachability Problem for CCS! (Q3090842) (← links)
- (Q3814799) (← links)
- Cyclic hypersequent system for transitive closure logic (Q6050767) (← links)
