DocumentCode :
2284366
Title :
Comparison of the Expressiveness of Time Petri Nets and Timed Automata
Author :
Xia, Chuanliang ; Yang, Lei ; Zhang, Zhijun
Author_Institution :
Sch. of Comput. Sci. & Technol., Shandong Jianzhu Univ., Jinan, China
Volume :
1
fYear :
2010
fDate :
13-14 March 2010
Firstpage :
800
Lastpage :
804
Abstract :
Among many models proposed for the specification and verification of real-time systems, Time Petri nets and Timed Automata are prominent. These two models which were developed independently for years bear strong relationships. In this paper we consider the relationship between these two models and survey the expressiveness of these two models w. r. t. timed language acceptance and (weak) timed bisimilarity.
Keywords :
Petri nets; automata theory; discrete event systems; real-time systems; real-time systems; time Petri nets; timed automata; timed bisimilarity; timed discrete event systems; timed language; Automata; Automation; Clocks; Computer science; Mechatronics; Petri nets; Real time systems; Software measurement; Streaming media; Time measurement; compressiveness; time Petri nets; timed automata; timed bisimilarity; timed language;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Measuring Technology and Mechatronics Automation (ICMTMA), 2010 International Conference on
Conference_Location :
Changsha City
Print_ISBN :
978-1-4244-5001-5
Electronic_ISBN :
978-1-4244-5739-7
Type :
conf
DOI :
10.1109/ICMTMA.2010.82
Filename :
5458974
Link To Document :
بازگشت