An operational semantics for timed CSP
From MaRDI portal
Publication:1891147
DOI10.1006/inco.1995.1014zbMath0827.68069WikidataQ60173625 ScholiaQ60173625MaRDI QIDQ1891147
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
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q55: Semantics in the theory of computing
Related Items
Bisimulation on speed: Lower time bounds, A TIMED FAILURE EQUIVALENCE PRESERVING ABSTRACTION FOR PARAMETRIC TIME-INTERVAL AUTOMATA, Process algebra for performance evaluation, Bisimulation on speed: Worst-case efficiency, A conservative look at operational semantics with variable binding, The timed failures -- Stability model for CSP, Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation, Timing and causality in process algebra