Say we have a place-transition digraph system. A transition can fire if all input places have marks. A transition fires by consuming items from input places and placing one into each output place. A number near the transition is a transition price. So, for example, we can get an image like this:

We want to find the cheapest path from `From`

to `To`

. So it is quite simple to see how one can modify Dijkstra to find a path in algorithm terms, yet in terms of formal theory in generalised case it does not look so simple and there can appear loops and loop step related conditions. So Is there a Dijkstra like pathfinding with condition satisfaction algorithm?