DocumentCode
1806117
Title
Reachability analysis for communication service specifications described in global state transition rules
Author
Sato, Masakazu
Author_Institution
ATR Commun. Syst. Res. Labs., Kyoto, Japan
Volume
3
fYear
1995
fDate
14-16 Nov 1995
Firstpage
1683
Abstract
The basic properties of reachability analysis for telecommunication service specifications, which are defined by production rules, are discussed. While reachability analyses for conventional specification description is limited to a certain small number of processes so far, we consider an unspecified large number of processes for the first time. This report clarifies the relationship between the number of processes in the system and the size of the set of reachable states defined as subset of global state. It also presents the existence of an upper bound for the set of reachable states and a method of determining the minimum number of processes required to obtain that upper bound. This makes it possible to analyze the reachability of a system for which an infinite number of processes are assumed
Keywords
formal verification; knowledge based systems; reachability analysis; specification languages; state estimation; telecommunication computing; telecommunication services; communication service specifications; global state transition rules; production rules; reachability analysis; reachable states; specification description; state estimation; system processes; upper bound; Laboratories; Production; Reachability analysis; Telecommunication services; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 1995. GLOBECOM '95., IEEE
Print_ISBN
0-7803-2509-5
Type
conf
DOI
10.1109/GLOCOM.1995.502697
Filename
502697
Link To Document