Modeling, Analysing, and Control of Agents Behaviour
An alternative approach to modeling and analysis of agents’ behaviour is presented in this chapter. The agents and agent systems are understood here to be discrete-event systems (DES). The approach is based on the place/transition Petri nets (P/T PN) that yield both the suitable graphical or mathematical description of DES and the applicable means for testing the DES properties as well as for the synthesis of the agents’ behaviour. The reachability graph (RG) of the P/T PN-based model of the agent system and the space of feasible states are found. The RG adjacency matrix helps to form an auxiliary hypermodel in the space of the feasible states. State trajectories representing the actual interaction processes among agents are computed by means of the mutual intersection of both the straight-lined reachability tree (developed from a given initial state toward a prescribed terminal one) and the backtracking reachability tree (developed from the desired terminal state toward the initial one; however, oriented toward the terminal state). Control interferences are obtained on the base of the most suitable trajectory chosen from the set of feasible ones.