Formalization of time and space

DOI10.1007/S001650050017zbMATH Open0934.68049OpenAlexW1971587456MaRDI QIDQ1293892FDOQ1293892

Authors: Eric C. R. Hehner 

Publication date: 29 June 1999

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001650050017

Recommendations

• scientific article; zbMATH DE number 3846835
• Using mappings to prove timing properties
• Theoretical Aspects of Computing - ICTAC 2004
• Factorizing proofs in timed CSP
• scientific article; zbMATH DE number 1212994

zbMATH Keywords

computational complexity

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (2)

• Weakest precondition reasoning for expected run-times of probabilistic programs
• A formal definition of time in LOTOS

This page was built for publication: Formalization of time and space

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