Petri Nets Are Less Expressive Than State-Extended PA

Warning

This publication doesn't include Institute of Computer Science. It includes Faculty of Informatics. Official publication website can be found on muni.cz.

Authors	KŘETÍNSKÝ Mojmír ŘEHÁK Vojtěch STREJČEK Jan
Year of publication	2008
Type	Article in Periodical
Magazine / Source	Theoretical Computer Science
MU Faculty or unit	Faculty of Informatics
Citation
Field	Informatics
Keywords	Petri nets; PA processes; bisimulation
Description	We show that the class of Petri nets is less expressive with respect to bisimulation equivalence than the class of PA processes extended with a finite state control unit.
Related projects:	Techniques for automatic verification and validation of software nad hardware systems Institute for Theoretical Computer Science Highly Parallel and Distributed Computing Systems Automated software verification Formal verification: algorithms, properties of modelling formalisms amd temporal logics New possibilities in automatic verification of network protocols