Marta
Kwiatkowska
10.1007/978-3-319-51046-0_2
doi
calculus
verification
This paper presents an assume-guarantee specification theory (aka interface theory from [11]) for modular synthesis and verification of real-time processes with critical timing constraints. Four operations, i.e. conjunction, disjunction, parallel and quotient, are defined over specifications, drawing inspirations from classic specification theories like refinement calculus [4, 19]. We show that a congruence (or pre-congruence) characterised by a trace-based semantics [14] captures exactly the notion of substitutivity (or refinement) between specifications.
theory
conjunction
operation
process
congruence
specification
https://scigraph.springernature.com/explorer/license/
inspiration
assume-guarantee specification theory
constraints
false
https://doi.org/10.1007/978-3-319-51046-0_2
notion of substitutivity
paper
capture
quotient
18-38
refinement calculus
parallel
chapter
timing constraints
notion
en
real-time process
specification theory
A Specification Theory of Real-Time Processes
synthesis
2016-12-18
critical timing constraints
trace-based semantics
substitutivity
modular synthesis
2016-12-18
semantics
2022-01-01T19:10
chapters
classic specification theories
disjunction
Ranko
Lazić
Chilton
Chris
Xu
Wang
Department of Computer Science, Swansea University, Swansea, UK
Department of Computer Science, Swansea University, Swansea, UK
Computation Theory and Mathematics
Gibson-Robinson
Thomas
Philippa
Hopcroft
Faron
Moller
Springer Nature
Information and Computing Sciences
Springer Nature - SN SciGraph project
pub.1042499020
dimensions_id
978-3-319-51046-0
Concurrency, Security, and Puzzles
978-3-319-51045-3
Department of Computer Science, University of Oxford, Oxford, UK
Department of Computer Science, University of Oxford, Oxford, UK