Pages that link to "Item:Q2576580"
From MaRDI portal
The following pages link to A refinement-based process algebra for timed automata (Q2576580):
Displaying 13 items.
- Compositional schedulability analysis of real-time actor-based systems (Q530212) (← links)
- Timewise refinement for communicating processes (Q676846) (← links)
- A process algebraic framework for specification and validation of real-time systems (Q968306) (← links)
- Reactive bisimulation semantics for a process algebra with timeouts (Q2687033) (← links)
- TPAP: an algebra of preemptive processes for verifying real-time systems with shared resources (Q2842574) (← links)
- Timed CSP = closed timed automata (Q2842610) (← links)
- Automatic Abstraction Refinement for Timed Automata (Q3510839) (← links)
- (Q4278673) (← links)
- Specification and Proof in Real Time CSP (Q4282003) (← links)
- Progress-preserving Refinements of CTA (Q5009458) (← links)
- Factorizing proofs in timed CSP (Q5887513) (← links)
- Timewise refinement for communicating processes (Q5890047) (← links)
- Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation (Q5896951) (← links)