Virual Oral Presentation Slide by Slide

IEEE/ICACT20210216 Slide.13        [Big Slide]	Oral Presentation
	TCTL is a mechanism that can express constant boundaries for delays between state transitions to model finite-state systems, and which is accepted by UPPAAL. E in TCTL means ¡®exists a path¡¯ in tree logic, and it is expressed as E in UPPAAL. A in TCTL means ¡®for all path¡¯ in tree logic, and it is expressed as A in UPPAAL. G in TCTL means ¡®all states in a path¡¯ in tree logic, and it is expressed as [] in UPPAAL. F in TCTL means ¡®some state in a path¡¯ in tree logic, and it is expressed as <> in UPPAAL.

[Go to Next Slide]

Select Voice: Virtual Oral Presentation!!