The following pages link to (Q3725534):
Displaying 18 items.
- Finite divergence (Q673876) (← links)
- A brief history of Timed CSP (Q674191) (← links)
- Fixed points without completeness (Q674192) (← links)
- A timed model for communicating sequential processes (Q1109561) (← links)
- TIC: a tImed calculus (Q1261314) (← links)
- The timed failures -- Stability model for CSP (Q1274446) (← links)
- An efficiency preorder for processes (Q1323358) (← links)
- Recursion induction for real-time processes (Q1329195) (← links)
- Processes with probabilities, priority and time (Q1343865) (← links)
- Time-abstracted bisimulation: Implicit specifications and decidability (Q1363777) (← links)
- A process algebra of communicating shared resources with dense time and priorities (Q1389685) (← links)
- Compositional verification of real-time systems with explicit clock temporal logic (Q1918934) (← links)
- The fixed-point theory of strictly causal functions (Q2257306) (← links)
- CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions (Q2340255) (← links)
- A Timed Process Algebra for Wireless Networks with an Application in Routing (Q2802472) (← links)
- Timed CSP = Closed Timed Automata1 (Q2842610) (← links)
- Unbounded nondeterminism in CSP (Q5887514) (← links)
- revTPL: The Reversible Temporal Process Language (Q6151560) (← links)
