scientific article; zbMATH DE number 3956423

Cited in

(31)

A timed model for communicating sequential processes
TIC: a tImed calculus
The timed failures -- Stability model for CSP
An efficiency preorder for processes
Recursion induction for real-time processes
Processes with probabilities, priority and time
Time-abstracted bisimulation: Implicit specifications and decidability
A process algebra of communicating shared resources with dense time and priorities
Timed-pNets: a communication behavioural semantic model for distributed systems
Compositional verification of real-time systems with explicit clock temporal logic
The fixed-point theory of strictly causal functions
CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
A timed process algebra for wireless networks with an application in routing (extended abstract)
Timed CSP = closed timed automata
scientific article; zbMATH DE number 4011913 (Why is no real title available?)
scientific article; zbMATH DE number 2087936 (Why is no real title available?)
Modeling Long–Running Transactions with Communicating Hierarchical Timed Automata
An efficiency preorder for processes
Towards a complete hierarchy of compositional dataflow models
Behavioural abstraction in TCCS
Unbounded nondeterminism in CSP
Time abstracted bisimulation: Implicit specifications and decidability
Timewise refinement for communicating processes
An introduction to compositional methods for concurrency and their application to real-time.
revTPL: The Reversible Temporal Process Language
A linear time process algebra
Deciding properties of regular real timed processes
Finite divergence
A brief history of Timed CSP
Fixed points without completeness
Timing is all you need

This page was built for publication:

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