Towards Petri net calculi based on synchronization via places

Authors:
N. A. Anisimov;A. A. Kovalenko
Affiliations:
-;-
Venue:
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Year:
1995

Citing 8
Cited 0

Introduction to the ISO specification language LOTOS

Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
A distributed operational semantics for CCS based on condition/event systems

Acta Informatica
Finite representations of CCS and TCSP programs by automata and Petri nets

Finite representations of CCS and TCSP programs by automata and Petri nets
On Representing CCS Programs by Finite Petri Nets

MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
Transformation from LOTOS Specifications to Galileo Nets

Proceedings of the First International Conference on Formal Description Techniques
Non Interleaving Process Algebra

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
The box calculus: a new causal algebra with multi-label communication

Advances in Petri Nets 1992, The DEMON Project
A basic-net algebra for program semantics and its application to OCCAM

Advances in Petri Nets 1992, The DEMON Project

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.