"1"^^ . "117-124" . "0"^^ . "10-th International Symposium Railways on the Edge of the 3-rd Millennium - \u017DEL 2003" . "2003-05-27+02:00"^^ . "1"^^ . "0"^^ . "7"^^ . "Modified Petri Nets Applied Within Simulations of Railway Systems" . "RIV/00216275:25510/03:00000266" . "[18E88459D287]" . "RIV/00216275:25510/03:00000266!RIV/2004/MSM/255104/N" . "\u017Dilinsk\u00E1 univerzita v \u017Diline" . . . "616184" . . . "Modified Petri Nets Applied Within Simulations of Railway Systems"@en . . "Paper deals with an original new subclass of P/T Petri net called decision graph (inspired by marked graphs), which disposes of the following features. There are defined two kinds of transitions within decision graph: (i) simple parameterized transitions, which differ from standard ones so that the transition parameter determines how many transition-preset places have to contain tokens in order the transition could be fired # in a standard case the transition is enabled only if all preset places disposeof tokens; (ii) decision parameterized transitions, which offer conditional token routing after them based upon interpretation of data related to current instances of tokens transiting those transitions. Decision graph enables flexible modeling of contr ol strategies of agents (utilized within Agent-Based Architecture of simulation models - ABAsim), which was successfully applied within many real projects focused mainly on railway-based systems."@en . "Modified Petri Nets Applied Within Simulations of Railway Systems" . . "25510" . . . "Modified Petri Nets Applied Within Simulations of Railway Systems"@en . . . . . . "80-7135-062-1" . . "railway system, Petri net"@en . "Kavi\u010Dka, Anton\u00EDn" . . "Z(MSM 255100002)" . "Paper deals with an original new subclass of P/T Petri net called decision graph (inspired by marked graphs), which disposes of the following features. There are defined two kinds of transitions within decision graph: (i) simple parameterized transitions, which differ from standard ones so that the transition parameter determines how many transition-preset places have to contain tokens in order the transition could be fired # in a standard case the transition is enabled only if all preset places disposeof tokens; (ii) decision parameterized transitions, which offer conditional token routing after them based upon interpretation of data related to current instances of tokens transiting those transitions. Decision graph enables flexible modeling of contr ol strategies of agents (utilized within Agent-Based Architecture of simulation models - ABAsim), which was successfully applied within many real projects focused mainly on railway-based systems." . "\u017Dilina" . "\u017Dilina" .