Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Ensuring completeness of symbolic verification methods for infinite-state systems
Theoretical Computer Science
Application of Petri Nets to Communication Networks, Advances in Petri Nets
Application of Petri Nets to Communication Networks, Advances in Petri Nets
Automated protocol verification
Proceedings of the IFIP WG6.1 Fifth International Conference on Protocol Specification, Testing and Verification V
On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Parameterized Verification with Automatically Computed Inductive Assertions
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Parameterized Reachability Trees for Predicate/Transition Nets
Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
Modelling the WAP Transaction Service using Coloured Petri Nets
MDA '99 Proceedings of the First International Conference on Mobile Data Access
Unbounded Verification Results by Finite-State Compositional Techniques: 10^any States and Beyond
CSD '98 Proceedings of the 1998 International Conference on Application of Concurrency to System Design
Symbolic Executions of Symmetrical Parallel Programs
PDP '96 Proceedings of the 4th Euromicro Workshop on Parallel and Distributed Processing (PDP '96)
ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Formalising TCP's Data Transfer Service Language: A Symbolic Automaton and its Properties
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Recursive Parametric Automata and ε-Removal
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
Using parametric automata for the verification of the stop-and-wait class of protocols
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
A parametric state space for the analysis of the infinite class of stop-and-wait protocols
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Formalising TCP's Data Transfer Service Language: A Symbolic Automaton and its Properties
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Hi-index | 0.00 |
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.