Discrete Event Systems are systems, the time evolution of which can be described by the occurence of events. Well-known examples of DESs are manufacturing systems and transportation networks. An important class of DESs can be described by the so-called (max,+) algebra, in which, compared to the usual arithmetic, the operator + is replaced by the operator max and the operator * is replaced by +. In this thesis we model a railroad network by means of the (max,+) algebra. Furthermore, we develop some theory concerning graphs corresponding to the (max,+) matrix. An extension of the (max,+) algebra is considered, that is, bipartite (min,max,+) systems and seperated (min,max,+) systems. Some theory is developed concerning the existence of the eigenvalue for these types of sytems. Furthermore, we have studied whether it is possible to model railroad networks by means of these kind of systems.