Pages that link to "Item:Q3763573"
From MaRDI portal
The following pages link to Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator (Q3763573):
Displaying 21 items.
- Refusal testing (Q580961) (← links)
- Conjunction on processes: Full abstraction via ready-tree semantics (Q875513) (← links)
- Global renaming operators in concrete process algebra (Q1106660) (← links)
- Algebraic and fixed point equations over inverse limits of algebras (Q1177146) (← links)
- Petri net semantics of priority systems (Q1190490) (← links)
- Automatizing parametric reasoning on distributed concurrent systems (Q1346610) (← links)
- A complete axiomatization of finite-state ACSR processes (Q1376418) (← links)
- A process algebra of communicating shared resources with dense time and priorities (Q1389685) (← links)
- Notes on the methodology of CCS and CSP (Q1391789) (← links)
- Modular specification of process algebras (Q1802074) (← links)
- Probabilistic may/must testing: retaining probabilities by restricted schedulers (Q1941883) (← links)
- Encoding safety in \(\mathrm{CLL}_R\) (Q2055960) (← links)
- CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions (Q2340255) (← links)
- Branching bisimulation for probabilistic systems: characteristics and decidability (Q2491633) (← links)
- An expressiveness study of priority in process calculi (Q3655761) (← links)
- On deciding some equivalences for concurrent processes (Q4362275) (← links)
- (Q4965857) (← links)
- (Q4989406) (← links)
- (Q5009710) (← links)
- Equations, Contractions, and Unique Solutions (Q5278202) (← links)
- Algebraic characterizations of trace and decorated trace equivalences over tree-like structures (Q5940926) (← links)
