An operational semantics for timed CSP

DOI10.1006/inco.1995.1014zbMath0827.68069OpenAlexW2037230951WikidataQ60173625 ScholiaQ60173625MaRDI QIDQ1891147

S. A. Schneider

Publication date: 28 May 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1014

zbMATH Keywords

operational semanticstimed CSP

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Related Items

Modelling and analysing neural networks using a hybrid process algebra, Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation, Bisimulation on speed: Lower time bounds, Bisimulation on speed: Worst-case efficiency, Timing and causality in process algebra, Translating between models of concurrency, Unnamed Item, On continuous time agents, Unnamed Item, Process algebra for performance evaluation, A conservative look at operational semantics with variable binding, The timed failures -- Stability model for CSP, A TIMED FAILURE EQUIVALENCE PRESERVING ABSTRACTION FOR PARAMETRIC TIME-INTERVAL AUTOMATA, Timed CSP = Closed Timed Automata1, The semantics and verification of timed service choreography