The following pages link to (Q4038732):
Displaying 24 items.
- A ground-complete axiomatization of stateless bisimilarity over Linda (Q477631) (← links)
- Nested semantics over finite trees are equationally hard (Q598202) (← links)
- Structural operational semantics for weak bisimulations (Q673123) (← links)
- Bisimilarity is not finitely based over BPA with interrupt (Q860878) (← links)
- Unique parallel decomposition in branching and weak bisimulation semantics (Q896916) (← links)
- Lifting non-finite axiomatizability results to extensions of process algebras (Q969643) (← links)
- The semantics of the combination of atomized statements and parallel choice (Q1267037) (← links)
- An axiomatic semantics for the synchronous language Gentzen. (Q1400575) (← links)
- Finite axiom systems for testing preorder and De Simone process languages (Q1575273) (← links)
- Rule formats for distributivity (Q1758150) (← links)
- CCS with Hennessy's merge has no finite-equational axiomatization (Q1763725) (← links)
- Decomposition orders -- another generalisation of the fundamental theorem of arithmetic (Q1781996) (← links)
- On the axiomatisability of priority. III: Priority strikes again (Q2193294) (← links)
- A Context-Free Process as a Pushdown Automaton (Q3541013) (← links)
- (Q3776606) (← links)
- The fork calculus (Q4630290) (← links)
- (Q5015359) (← links)
- (Q5028469) (← links)
- Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? (Q5056368) (← links)
- (Q5089283) (← links)
- A Basic Parallel Process as a Parallel Pushdown Automaton (Q5170665) (← links)
- The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems (Q5262950) (← links)
- An axiomatic semantics for Esterel (Q5958617) (← links)
- Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction (Q6163879) (← links)
