Recursive Parametric Automata and ε-Removal

Authors:
Lin Liu;Jonathan Billington
Affiliations:
School of Computer and Information Science,;Computer Systems Engineering Centre, University of South Australia,
Venue:
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
Year:
2009

Citing 10
Cited 0

Compiler construction: theory and practice (2nd ed.)

Compiler construction: theory and practice (2nd ed.)
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
Compiler Construction: Principles and Practice

Compiler Construction: Principles and Practice
Model Checking of Unrestricted Hierarchical State Machines

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Tackling the Infinite State Space of a Multimedia Control Protocol Service Specification

ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Analysis of Recursive State Machines

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Obtaining the Service Language for H.245's Multimedia Capability Exchange Signalling Protocol: the Final Step

MMM '04 Proceedings of the 10th International Multimedia Modelling Conference
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
Parametric Language Analysis of the Class of Stop-and-Wait Protocols

PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work is motivated by and arose from the parametric verification of communication protocols over unbounded channels, where the channel capacity is the parameter. Verification required the use of finite state automata (FSA) reduction, including ε -removal, for a specific infinite family of FSA. This paper generalises this work by introducing Recursive Parametric FSA (RP-FSA), an infinite family of FSA that can be represented recursively in a single parameter. Further, the paper states and proves a necessary and sufficient condition regarding the transformation of a RP-FSA to its language equivalent ε -removed family of FSA that is also a RP-FSA in the same parameter. This condition also guarantees a further structural property regarding the RP-FSA and its ¿ -removed family.