Title :
Unbounded verification results by finite-state compositional techniques: 10any states and beyond
Author :
Valmari, Antti ; Kokkarinen, Ilkka
Author_Institution :
Software Syst. Lab., Tampere Univ. of Technol., Finland
Abstract :
The article describes how to use process algebraic compositional finite state verification techniques for infinite parameterised families of systems. The parameter is incremented by adding a new process, and automated techniques establish that this does not change the externally observable behaviour. Therefore, all systems in the family behave identically. Channel fairness and independence of retransmission bounds are used as examples
Keywords :
computational linguistics; finite state machines; formal verification; parallel programming; process algebra; theorem proving; automated techniques; channel fairness; externally observable behaviour; finite state compositional techniques; infinite parameterised families; process algebraic compositional finite state verification techniques; retransmission bound independence; unbounded verification results; Channel capacity; Counting circuits; Laboratories; Protocols; Software systems; System recovery; Upper bound;
Conference_Titel :
Application of Concurrency to System Design, 1998. Proceedings., 1998 International Conference on
Conference_Location :
Fukushima
Print_ISBN :
0-8186-8350-3
DOI :
10.1109/CSD.1998.657541
