Read Operators and their Expressiveness in Process Algebras

Details Read Operators and their Expressiveness in Process Algebras Read Operators and their Expressiveness in Process Algebras

2011-08-23

arxiv.org/abs/1108.4466v1

EPTCS 64, 2011, pp. 31-43

Computer Science

Logic in Computer Science

In Proceedings EXPRESS 2011, arXiv:1108.4077

Scientific paper

10.4204/EPTCS.64.3

We study two different ways to enhance PAFAS, a process algebra for modelling asynchronous timed concurrent systems, with non-blocking reading actions. We first add reading in the form of a read-action prefix operator. This operator is very flexible, but its somewhat complex semantics requires two types of transition relations. We also present a read-set prefix operator with a simpler semantics, but with syntactic restrictions. We discuss the expressiveness of read prefixes; in particular, we compare them to read-arcs in Petri nets and justify the simple semantics of the second variant by showing that its processes can be translated into processes of the first with timed-bisimilar behaviour. It is still an open problem whether the first algebra is more expressive than the second; we give a number of laws that are interesting in their own right, and can help to find a backward translation.

Affiliated with

Also associated with

No associations

Rating

Read Operators and their Expressiveness in Process Algebras 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 Read Operators and their Expressiveness in Process Algebras, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Read Operators and their Expressiveness in Process Algebras will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-66557