Abstract
The Capability Exchange Signalling (CES) protocol is a control protocol for multimedia communications developed by the International Telecommunication Union (ITU) [3]. Our goal is to verify this protocol against the set of allowable sequences of service primitives (i.e. user observable events), known as the service language. Thus the first step to verify the CES protocol is to obtain the CES service language. By using automata reduction techniques [2], our approach is to extract the service language from the Occurrence Graph (OG) of the Coloured Petri Net (CPN) model [4] for the protocol’s service definition. The OG of a CPN model is a directed graph comprising all reachable states (nodes) and state changes (edges) of the model.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abdulla, P.A., Collomb-Annichini, A., Bouajjani, A., Jonsson, B.: Using Forward Reachability Analysis for Verification of Lossy Channel Systems. Formal Methods in System Design 25(1), 39–65 (2004)
Barrett, W.A., Couch, J.D.: Compiler Construction : Theory and Practice. Science Research Associates (1979)
ITU-T. Recommendation H.245, Control protocol for multimedia communication (July 2001)
Jensen, K.: Coloured Petri nets: Basic Concepts. In: Analysis Methods and Practical Use, 2nd edn., vol. 1, 2, 3, Springer, Heidelberg (1997)
AT&T FSM LibraryTM, http://www.research.att.com/sw/tools/fsm/
Liu, L., Billington, J.: Tackling the Infinite State Space of a Multimedia Control Protocol Service Specification. In: Esparza, J., Lakos, C.A. (eds.) ICATPN 2002. LNCS, vol. 2360, pp. 273–293. Springer, Heidelberg (2002)
Liu, L., Billington, J.: A Proof of the Recursive Formula for the Infinite Service Language of the CES Protocol. Technical report, CSEC-13, Computer Systems Engineering Centre, University of South Australia (January) 2003 (revised in Jun 2004)
Liu, L., Billington, J.: Obtaining the Service Language for H.245’s Multimedia Capability Exchange Signalling Protocol: the Final Step. In: Proc. the 10th Int. Multi-Media Modelling Conf., Brisbane, Australia, January 2004, pp. 323–328 (2004)
Roychoudhury, A., Ramakrishnan, I.V.: Inductively Verifying Invariant Properties of Parameterized Systems. Automated Software Engineering Journal 11(2), 101–139 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, L., Billington, J. (2004). Reducing Parametric Automata: A Multimedia Protocol Service Case Study. In: Wang, F. (eds) Automated Technology for Verification and Analysis. ATVA 2004. Lecture Notes in Computer Science, vol 3299. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30476-0_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-30476-0_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23610-8
Online ISBN: 978-3-540-30476-0
eBook Packages: Springer Book Archive