Similarity of generalized resources in petri nets

Authors:
Vladimir A. Bashkin;Irina A. Lomazova
Affiliations:
Yaroslavl State University, Yaroslavl, Russia;Program Systems Institute of the Russian Academy of Science, Pereslavl-Zalessky, Russia
Venue:
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Year:
2005

Citing 5
Cited 0

A Calculus of Communicating Systems

A Calculus of Communicating Systems
Decidability Questions for Bismilarity of Petri Nets and Some Related Problems

STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Place Bisimulations in Petri Nets

Proceedings of the 13th International Conference on Application and Theory of Petri Nets
Petri nets and resource bisimulation

Fundamenta Informaticae - Concurrency specification and programming
Bisimulation and the reduction of Petri nets

ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets

Quantified Score

Hi-index	0.00

Visualization

Abstract

Generalized resources are defined as multisets of Petri net vertices. Here places represent material resources (designated by tokens residing in these places). Transitions correspond to activity resources represented by transition firings. Two generalized resources are called similar if in any Petri net marking one resource can be replaced by another without changing the observable system's behaviour (modulo bisimulation). In this paper we study some basic properties of generalized resource similarity and prove that, being undecidable, generalized resource similarity is finitely based, and thus can be finitely described. We show also, that similarity of generalized resources allows to express some substantial properties of systems modelled by Petri nets.