M.B. van der Zwaag. The cones and foci proof technique for timed transition systems. Information Processing Letters, 80(1):33--40, 2001.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Cones and Foci for Protocol Verification Revisited - Fokkink, Pang (2003) (Correct)
....such as the precondition e#ect notation [Jon87, LT87] invariants and simulations. Linear process equations resemble the UNITY format [CM88] and recursive applicative program schemes [Cou90] state mappings are comparable to refinement mappings [LV95, PSS98] and simulation [FP97] Van der Zwaag [vdZ01] gave an adaptation of the cones and foci method from [GS01] to a timed setting, modulo timed branching bisimulation equivalence. We leave it as an open question whether our innovations for the cones and foci method can also be introduced in this timed setting. 2. Preliminaries 2.1 CRL CRL ....
M.B. van der Zwaag. The cones and foci proof technique for timed transition systems. Information Processing Letters, 80(1):33--40, 2001.
Cones and Foci for Protocol Verification Revisited - Fokkink, Pang (2003) (Correct)
No context found.
M.B. van der Zwaag. The cones and foci proof technique for timed transition systems. Information Processing Letters, 80(1):33--40, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC