Analyzing Non-determinism in Telecommunication Services Using P-invariant of Petri-Net Model

  • Authors:
  • Masahide Nakamura;Yoshiaki Kakuda;Tohru Kikuno

  • Affiliations:
  • -;-;-

  • Venue:
  • INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

Telecommunication service specifications are often modeled by the state transition machine in which a state moves to a next state by the execution of the user's event. If multiple transitions exist for a certain pair of state and user's event, then a non-deterministic behavior occurs at the state.As the result, the non-deterministic behavior causes an illegal state transition against the user's intention, and thus should be eliminated from the state transition machine. The conventional analysis method for non-determinism is based on reachability analysis. Since the method must exhaustively enumerate all reachable states of the state transition machine, it cannot be applied to the complex communication services which include many users.This paper proposes a new analysis method based on a Petri-net model. The method constructs a logically equivalent Petri-net for a given service specification, and obtains a set of states which cause the non-deterministic behaviors using rules in the service specification. Then, the method identifies states in the set which are not reachable from the initial state using P-invariant of the Petri-net, and deletes them from the set. As P-invariant is sufficient condition, we must finally apply reachability analysis to states in the resultant set. Since the number of states in the resultant set may be reduced to relatively small, the new method enables us to analyze the more complex services.