Multi-Agent Petri-Games

We introduce a language for the representation of a subset of strategic interactions. The representation is based on Petri nets. Representable games are restricted to have a finite number of states and actions. The language is additionally able to define time critical processes with discrete time periods. It can be used for both tasks of practical game computing: definition of game servers and calculating game theoretical or heuristic solutions. Theoretical analyzes, syntactical details, algorithms and concrete examples are given.