By Topic

Verifying Time-Estelle specification using communicating time Petri nets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tsang, T. ; Sch. of Comput. Sci. & Comput. Eng., La Trobe Univ., Bundoora, Vic., Australia ; Lai, R.

Estelle, an internationally standardized Formal Description Technique (FDT), does not have enough expressive power to describe timing behaviours of distributed or multimedia system. To address this limitation, we have developed Time-Estelle, an extended Estelle which is capable of doing so. Past techniques employed for verifying Estelle specifications have not considered time factors and were usually based on a variant or a subset of Estelle and all translating such specifications to another form, such as Finite State Machines or Petri Nets. This paper describes a method of verifying Time-Estelle specification using Communicating Time Petri Nets (CmTPNs)

Published in:

Information Networking, 1998. (ICOIN-12) Proceedings., Twelfth International Conference on

Date of Conference:

21-23 Jan 1998