A brief history of Timed CSP

DOI10.1016/0304-3975(94)00169-JMaRDI QIDQ674191zbMATHDBLPWikidataFDO

Authors 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)

Recommendations

• An operational semantics for timed CSP
• Timed CSP = closed timed automata
• Publication:4436974
• Tractable combinations of temporal CSPs
• A branching time model of CSP
• Lectures on Concurrency and Petri Nets
• The complexity of temporal constraint satisfaction problems

Cites work

• scientific article; zbMATH DE number 1638657 (Why is no real title available?)
• scientific article; zbMATH DE number 1678357 (Why is no real title available?)
• scientific article; zbMATH DE number 3902016 (Why is no real title available?)
• scientific article; zbMATH DE number 3956423 (Why is no real title available?)
• scientific article; zbMATH DE number 4011913 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 4050970 (Why is no real title available?)
• scientific article; zbMATH DE number 4081518 (Why is no real title available?)
• A process algebra for timed systems
• Algebraic laws for nondeterminism and concurrency
• Communicating sequential processes
• Real time process algebra
• Recursion induction for real-time processes
• Specification and Proof in Real Time CSP
• Specification and compositional verification of real-time systems
• The expressiveness of CSP with priority

Cited in

(24)

• Equivalence checking 40 years after: a review of bisimulation tools
• A TIMED FAILURE EQUIVALENCE PRESERVING ABSTRACTION FOR PARAMETRIC TIME-INTERVAL AUTOMATA
• Specification and Proof in Real Time CSP
• The Verus language: Representing time efficiently with BDDs
• scientific article; zbMATH DE number 2086958 (Why is no real title available?)
• The timed failures -- Stability model for CSP
• A process algebraic framework for specification and validation of real-time systems
• Recursion induction for real-time processes
• Specifying termination in CSP
• Finite divergence
• Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format
• Faster asynchronous systems.
• Translating between models of concurrency
• Towards verification of computation orchestration
• Computer-aided development of a real-time program
• Reflections on the future of concurrency theory in general and process calculi in particular
• An operational semantics for timed CSP
• A CSP model with flexible parallel termination semantics
• Probabilistic and prioritized models of timed CSP
• scientific article; zbMATH DE number 2059569 (Why is no real title available?)
• A theory of Orwellian specifications with NewThink
• A complete axiomatization of finite-state ACSR processes
• A fixpoint theory for non-monotonic parallelism
• scientific article; zbMATH DE number 7350777 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674191)