Recursion induction for real-time processes

DOI10.1007/BF01211248zbMath0806.68073OpenAlexW2083644882WikidataQ60173633 ScholiaQ60173633MaRDI QIDQ1329195

Jim Davies, S. A. Schneider

Publication date: 29 June 1994

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01211248

zbMATH Keywords

communicating sequential processestimed distributed systems

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Distributed algorithms (68W15)

Related Items (9)

Reactive bisimulation semantics for a process algebra with timeouts ⋮ Timewise refinement for communicating processes ⋮ Probabilistic communicating processes ⋮ A brief history of Timed CSP ⋮ Fixed points without completeness ⋮ Unnamed Item ⋮ May Testing, Non-interference, and Compositionality ⋮ Changing system interfaces consistently: a new refinement strategy for CSP\(\|\)B ⋮ Unnamed Item

Cites Work

• On the consistency of Koomen's fair abstraction rule
• A process algebra for timed systems
• Real time process algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recursion induction for real-time processes