Read Operators and their Expressiveness in Process Algebras

Autor:	Corradini, Flavio, Di Berardini, Maria Rita, Vogler, Walter
Rok vydání:	2011
Předmět:	Computer Science - Logic in Computer Science Computer Science - Distributed Parallel and Cluster Computing Computer Science - Performance
Zdroj:	EPTCS 64, 2011, pp. 31-43
Druh dokumentu:	Working Paper
DOI:	10.4204/EPTCS.64.3
Popis:	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. Comment: In Proceedings EXPRESS 2011, arXiv:1108.4077
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1108.4466 Zobrazit plný text záznamu View this record from Arxiv