Abstract
Coloured Petri Nets (CPNs) are used to model the service provided by an International Standard for the control of multimedia communications over telecommunication networks including the Internet, known as the Capability Exchange Signalling (CES) protocol. The state space of the CPN model includes all of the possible sequences of user observable events, known as the service language, which is a useful baseline against which the protocol can be verified. However, the CES service CPN possesses an infinite state space, due to unbounded communication channels. We parameterize the CPN with the channel capacity, propose and prove a recursive formula for its state space and provide an algorithm for its construction. The algorithm generates the state space for capacity l, from the state space for capacity l - 1, providing incremental state space generation rather than generating a new state space for each value of l. The state space is linear in the size of the channel.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Parosh Aziz Abdulla, Ahmed Bouajjani, and Bengt Jonsson. On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels. In Proc. of the 10th Int. Conf. on Computer Aided Verification (CAV’98), pages 305–318, 1998.
Parosh Aziz Abdulla and Bengt Jonsson. Ensuring completeness of symbolic verification methods for infinite-state systems. Theoretical Computer Science, 256:145–167, 2001.
T. Arons, A. Pnueli, S. Ruah, J. Xu, and L. Zuck. Parameterized Verification with Automatically Computed Inductive Assertions. In Proc. of the 13th Int. Conf. on Computer Aided Verification (CAV’01), Paris, Jul. 2001. Springer-Verlag.
W. A. Barret and J. D. Couch Compiler Construction: Theory and Practice. Science Research Associates, 1979.
Kai Baukus, Yassine Lakhnech, and Karsten Stahl. Verification of Parameterized Protocols. Journal of Universal Computer Science, 7(2):141–158, 2001.
J. Billington, M. C. Wilbur-Ham, and M. Y. Bearman. Automated Protocol Verification. In M. Diaz, editor, Protocol Specification, Testing and Verification, V, pages 59–70. Elsevier Science Publisher B. V. (North-Holland), 1986.
Jonathan Billington. Formal Specification of Protocols: Protocol Engineering. In Allen Kent, James G. Williams, and Rosalind Kent, editors, Encyclopedia of Microcomputers, Vol. 7, pages 299–314. Marcel Dekker, Inc., 1991.
Jonathan Billington, Michel Diaz, and Grzegorz Rozenberg, editors. Application of Petri Nets to Communication Networks: Advances in Petri Nets. LNCS 1605. Springer, 1999.
Steven Gordon and Jonathan Billington. Analysing a Missile Simulator with Coloured Petri Nets. International Journal on Software Tools for Technology Transfer, 2(2), Dec. 1998.
Steven Gordon and Jonathan Billington. Modelling the WAP Transaction Service using Coloured Petri Nets. In Proc. of the 1st Int. Conf. on Mobile Data Access LNCS 1748, pages 109–118. Springer-Verlag, Dec. 1999.
Design/CPN homepage. http://www.daimi.au.dk/designCPN/.
ITU-T. ITU-T Recommendation X.210, Information Technology-Open Systems Interconnection-Basic Reference Model: Conventions for the Definition of OSI Services, Nov. 1993.
ITU-T. ITU-T Recommendation X.214, Information Technology-Open Systems Interconnection-Transport Service Definition, Nov. 1995.
ITU-T. ITU-T Recommendation H.245, Control Protocol for Multimedia Communication, Nov. 2000.
Kurt Jensen. Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use, vol 2 and vol 3. Springer, 2nd edition, 1997.
Markus Lindqvist. Parameterized Reachability Trees for Predicate/Transition nets, pages 301–324. LNCS 674. Springer-Verlag, 1993.
Lin Liu and Jonathan Billington. Modelling and Analysis of Internet Multimedia Protocols-Methodology and Initial Results. In Proc. of the 11th Annual Int. Symp. of the Int. Council on Systems Engineering (INCOSE’2001), CD-ROM, paper 3.2.4, Melbourne, Australia, Jul. 2001.
Lin Liu and Jonathan Billington. Modelling and Analysis of the CES Protocol of H.245. In Proc. of the 3rd Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, pages 95–114, Aarhus, Denmark, Aug. 2001.
Andrew S. Tanenbaum. Communication Networks. Prentice-Hall International, Inc., third edition, 1996.
Antti Valmari and Ilkka Kokkarinen. Unbounded Verification Results by Finite-State Compositional Techniques: 10any States and Beyond. In Proc. of 1998 Int. Conf. on Application of Concurrency to System Design, pages 75–85, Aizu-Wakamatsu, Fukushima, Japan, Mar. 1998. IEEE Computer Society.
Isabelle Vernier. Symbolic Excecutions of Symmetrical Parallel Programs. In Proc. of the 4th Euromicro Workshop on Parallel and Distributed Processing (PDP’96), pages 327–324, Los Alamitos, CA, USA, 1996. IEEE Computer Society.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, L., Billington, J. (2002). Tackling the Infinite State Space of a Multimedia Control Protocol Service Specification. In: Esparza, J., Lakos, C. (eds) Application and Theory of Petri Nets 2002. ICATPN 2002. Lecture Notes in Computer Science, vol 2360. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48068-4_17
Download citation
DOI: https://doi.org/10.1007/3-540-48068-4_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43787-1
Online ISBN: 978-3-540-48068-6
eBook Packages: Springer Book Archive