The following pages link to (Q3805920):
Displaying 27 items.
- Contextual equivalences in configuration structures and reversibility (Q347363) (← links)
- Recognizable languages in concurrency monoids (Q672317) (← links)
- Location equivalence in a parametric setting (Q672708) (← links)
- A partial ordering semantics for CCS (Q914400) (← links)
- Automatic verification of distributed systems: the process algebra approach. (Q960505) (← links)
- Making random choices invisible to the scheduler (Q979081) (← links)
- Representation of computations in concurrent automata by dependence orders (Q1269906) (← links)
- A process algebra with distributed priorities (Q1276244) (← links)
- Non-interleaving semantics for mobile processes (Q1285660) (← links)
- A static view of localities (Q1329199) (← links)
- Comparing locality and causality based equivalences (Q1342503) (← links)
- Automatizing parametric reasoning on distributed concurrent systems (Q1346610) (← links)
- Labelled domains and automata with concurrency (Q1346626) (← links)
- A causal semantics for CCS via rewriting logic (Q1606128) (← links)
- Relating conflict-free stable transition and event models via redex families (Q1608893) (← links)
- Language-based performance prediction for distributed and mobile systems (Q1854534) (← links)
- Trace nets and process automata (Q1902303) (← links)
- Realisability of pomsets (Q2011200) (← links)
- Concurrencies in reversible concurrent calculi (Q2097423) (← links)
- A calculus of branching processes (Q2286743) (← links)
- \(\pi\)-calculus with noisy channels (Q2570971) (← links)
- Reversing algebraic process calculi (Q2643334) (← links)
- Event structure semantics for multiparty sessions (Q2683035) (← links)
- Egalitarian State-Transition Systems (Q2827838) (← links)
- A Chart Semantics for the Pi-Calculus (Q2864369) (← links)
- Connections between a concrete and an abstract model of concurrent systems (Q5887511) (← links)
- The correctness of concurrencies in (reversible) concurrent calculi (Q6151611) (← links)
