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
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 |
The Capability Exchange Signalling (CES) protocolis a sub-protocol of ITU-T Recommendation H.245,"Control protocol for multimedia communication".We are interested in verifying this protocol, includingverification of its general properties such as absenceof deadlocks and livelocks, and verification of theprotocol against its service.In previous work, we haveanalysed the general properties of the CES protocol.In order to verify the protocol against its service, weneed to generate the CES service language, whichdefines all the possible sequences of user observableevents.We firstly create the CES service CPN modeland then extract the language from the OccurrenceGraph (OG) of the model.In the case of the CESservice this is challenging because we wish to have ageneral result for arbitrary capacity of the networkover which the CES protocol operates.To tackle thisproblem we introduced into the CPN model a parameter, l, representing the capacity of the communicationchannel.We derived a recursive formula for the parameterised OG in terms of l.We treat this OGas a Finite State Automaton (FSA) by nominatingacceptance states and apply FSA reduction algorithmsto obtain a deterministic FSA that represents theCES service language.We have discovered a recursiveformula in l for the CES service language.This paperintroduces the CES service via its CPN model asnecessary background and presents the final step ofthe proof of this finding.