Computer Science – Logic in Computer Science
Scientific paper
2010-11-30
EPTCS 41, 2010, pp. 76-90
Computer Science
Logic in Computer Science
In Proceedings EXPRESS'10, arXiv:1011.6012
Scientific paper
10.4204/EPTCS.41.6
We introduce the process calculus Multi-CCS, which extends conservatively CCS with an operator of strong prefixing able to model atomic sequences of actions as well as multiparty synchronization. Multi-CCS is equipped with a labeled transition system semantics, which makes use of a minimal structural congruence. Multi-CCS is also equipped with an unsafe P/T Petri net semantics by means of a novel technique. This is the first rich process calculus, including CCS as a subcalculus, which receives a semantics in terms of unsafe, labeled P/T nets. The main result of the paper is that a class of Multi-CCS processes, called finite-net processes, is able to represent all finite (reduced) P/T nets.
Gorrieri Roberto
Versari Cristian
No associations
LandOfFree
A Process Calculus for Expressing Finite Place/Transition Petri Nets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Process Calculus for Expressing Finite Place/Transition Petri Nets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Process Calculus for Expressing Finite Place/Transition Petri Nets will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-444503