A complete proof system for timed observations

DOI10.1007/3-540-53982-4_23MaRDI QIDQ2736355zbMATH OpenFDO

Authors Yolanda Ortega-Mallén, David de Frutos Escrig

Publication date 29 August 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-53982-4_23

Mathematics Subject Classification ID

Logic in computer science (03B70) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Algebraic theory of languages and automata (68Q70)

Cited in

(1)

• A brief history of Timed CSP

This page was built for publication: A complete proof system for timed observations

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