Results 1 -
3 of
3
The cones and foci proof technique for timed transition systems
- Information Processing Letters
"... ..."
Is timed branching bisimilarity an equivalence indeed
- In Formal Modeling and Analysis of Timed Systems, Third International Conference, FORMATS 2005
, 2005
"... Abstract. We show that timed branching bisimilarity as defined by van der Zwaag [14] and Baeten & Middelburg [2] is not an equivalence relation, in case of a dense time domain. We propose an adaptation based on van der Zwaag’s definition, and prove that the resulting timed branching bisimilarity is ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
Abstract. We show that timed branching bisimilarity as defined by van der Zwaag [14] and Baeten & Middelburg [2] is not an equivalence relation, in case of a dense time domain. We propose an adaptation based on van der Zwaag’s definition, and prove that the resulting timed branching bisimilarity is an equivalence indeed. Furthermore, we prove that in case of a discrete time domain, van der Zwaag’s definition and our adaptation coincide. 1
eRENA3.1] Demonstration and Evaluation of Inhabited Television, eRENA Deliverable 3.1
- Proceedings of the 6th Workshop on Real-Time Systems (ARTS’04
, 1998
"... Abstract. The cones and foci verification method from Groote and Springintveld [9] was extended to timed systems by van der Zwaag [17]. We present an extension of this cones and foci method for timed systems, which can cope with infinite τ-sequences. We prove soundness of our approach and give small ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Abstract. The cones and foci verification method from Groote and Springintveld [9] was extended to timed systems by van der Zwaag [17]. We present an extension of this cones and foci method for timed systems, which can cope with infinite τ-sequences. We prove soundness of our approach and give small verification examples. 1
