A brief history of Timed CSP

DOI10.1016/0304-3975(94)00169-JzbMath0874.68162WikidataQ60173621 ScholiaQ60173621MaRDI QIDQ674191

Jim Davies, S. A. Schneider

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

timed CSP

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (19)

A fixpoint theory for non-monotonic parallelism ⋮ Computer-aided development of a real-time program ⋮ A theory of Orwellian specifications with NewThink ⋮ A complete axiomatization of finite-state ACSR processes ⋮ Translating between models of concurrency ⋮ Unnamed Item ⋮ Specifying termination in CSP ⋮ Faster asynchronous systems. ⋮ Equivalence checking 40 years after: a review of bisimulation tools ⋮ Finite divergence ⋮ Probabilistic and prioritized models of timed CSP ⋮ A process algebraic framework for specification and validation of real-time systems ⋮ Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format ⋮ Towards verification of computation orchestration ⋮ The timed failures -- Stability model for CSP ⋮ A TIMED FAILURE EQUIVALENCE PRESERVING ABSTRACTION FOR PARAMETRIC TIME-INTERVAL AUTOMATA ⋮ A CSP model with flexible parallel termination semantics ⋮ The Verus language: Representing time efficiently with BDDs ⋮ Reflections on the Future of Concurrency Theory in General and Process Calculi in Particular

Cites Work

• Specification and compositional verification of real-time systems
• Recursion induction for real-time processes
• A process algebra for timed systems
• The expressiveness of CSP with priority
• Real time process algebra
• Algebraic laws for nondeterminism and concurrency
• Communicating sequential processes
• Specification and Proof in Real Time CSP
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A brief history of Timed CSP