The cones and foci proof techniques for timed transition systems
We propose an extension of the cones and foci proof technique that can be used to prove timed branching bisimilarity of states in timed transition systems. We prove the correctness of this technique and we give an example verification.
|Formal languages and automata (msc 68Q45), Specification and verification (program logics, model checking, etc.) (msc 68Q60), Algebraic theory of languages and automata (msc 68Q70)|
|Software Engineering [SEN]|
van der Zwaag, M.B. (2000). The cones and foci proof techniques for timed transition systems. Software Engineering [SEN]. CWI.