The following pages link to A brief history of Timed CSP (Q674191):
Displaying 19 items.
- Specifying termination in CSP (Q407510) (← links)
- Finite divergence (Q673876) (← links)
- Probabilistic and prioritized models of timed CSP (Q674193) (← links)
- Towards verification of computation orchestration (Q736807) (← links)
- A process algebraic framework for specification and validation of real-time systems (Q968306) (← links)
- A CSP model with flexible parallel termination semantics (Q1037248) (← links)
- The timed failures -- Stability model for CSP (Q1274446) (← links)
- A complete axiomatization of finite-state ACSR processes (Q1376418) (← links)
- Faster asynchronous systems. (Q1401952) (← links)
- The Verus language: Representing time efficiently with BDDs (Q1589589) (← links)
- A fixpoint theory for non-monotonic parallelism (Q1884887) (← links)
- A theory of Orwellian specifications with NewThink (Q1906042) (← links)
- Translating between models of concurrency (Q2182666) (← links)
- Reflections on the Future of Concurrency Theory in General and Process Calculi in Particular (Q2870196) (← links)
- Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format (Q3605462) (← links)
- Specification and Proof in Real Time CSP (Q4282003) (← links)
- Computer-aided development of a real-time program (Q4798476) (← links)
- (Q4989406) (← links)
- A TIMED FAILURE EQUIVALENCE PRESERVING ABSTRACTION FOR PARAMETRIC TIME-INTERVAL AUTOMATA (Q5484905) (← links)
