User:Seguso45

Dies ist eine Probeseite.



Algorithms and restricted Formalisms
Standard Petri net properties like reachabilty, boundedness and liveness show a mixed picture. A paper of Köhler-Bußmeier gives survey of decidability results for elementary object systems. To reduce the complexity of the formalism subclasses have been defined by restricting the structure of the Petri nets, as for instance to state machines. Such restrictions still allow complex modelling of distributed and mobile systems, but have polynomial complexity in model checking.