By Topic

Towards Petri net calculi based on synchronization via places

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Anisimov, N.A. ; Inst. of Autom. & Control Process., Acad. of Sci., Vladivostok, Russia ; Kovalenko, A.A.

The paper addresses the problem of designing Petri net based calculi. It is pointed out that almost all existing problem oriented Petri net calculi have been developed in an ad hoc fashion, and the need for a basic formal tool which will help their design is stressed. We introduce a series of place synchronization operations ranging from primitive place synchronization to the general synchronization via place access points. We consider some examples where the place synchronization operation can be successfully used to model place merging, sequentialization and disabling

Published in:

Parallel Algorithms/Architecture Synthesis, 1995. Proceedings., First Aizu International Symposium on

Date of Conference:

15-17 Mar 1995