A brief history of Timed CSP

DOI10.1016/0304-3975(94)00169-JzbMATH Open0874.68162DBLPjournals/tcs/DaviesS95WikidataQ60173621 ScholiaQ60173621MaRDI QIDQ674191FDOQ674191

Authors: Jim Davies, S. A. Schneider 

Publication date: 28 February 1997

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

Recommendations

• An operational semantics for timed CSP
• Timed CSP = closed timed automata
• scientific article; zbMATH DE number 2013589
• scientific article; zbMATH DE number 7566067
• A branching time model of CSP
• Lectures on Concurrency and Petri Nets
• The complexity of temporal constraint satisfaction problems

zbMATH Keywords

timed CSP

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Algebraic laws for nondeterminism and concurrency
• Title not available (Why is that?)
• Communicating sequential processes
• A process algebra for timed systems
• Real time process algebra
• The expressiveness of CSP with priority
• Specification and compositional verification of real-time systems
• Specification and Proof in Real Time CSP
• Recursion induction for real-time processes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (24)

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

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)