Equivalence of infinite behavior of finite automata

AbstractGiven a finite automaton, its infinite behavior is defined by Büchi (1962), Eilenberg (1974) and McNaughton (1966) as the set of all infinite sequences of letters which label paths passing infinitely many times through a given subset of states. Two finite automata are said to be equivalent when their infinite behaviors are equal.In this paper we give a necessary and sufficient condition of equivalence, which uses considerations over finite behaviors only. An algorithm for the general case (deterministic or not) is given; its time and space complexity is better than any other existent method

A bandwidth scheduling method for efficient resource allocation in ATM networks

In this paper we address the problem of call admission and resource reservation control in ATM networks, where customers can book their connections in advance. This is very likely to be a realistic situation for services where customers order a connection to be established some time later. The proposed framework can be used for the admission and resource reservation control for leased line services or the establishment of Virtual Private Networks (VPN), but also for services like video conferencing and video broadcasting. Point-to-point as well as point-to-multipoint connections are considered. We present a detailed mathematical model. Different solution techniques are proposed and their performance compared. A resource reservation and allocation planning tool is being developed. We will show by simulations that one can gain significant benefit from using bandwidth scheduling