Relating Fairness and Timing in Process Algebras

Corradini, F; BERARDINI M, Di; Vogler, W

doi:10.1007/978-3-540-45187-7_29

CAMPUS è l'Archivio istituzionale delle pubblicazioni scientifiche dell’Università di Camerino. E’ un sistema aperto, pubblico e interoperabile che raccoglie, conserva ed espone i dati relativi alle attività e ai prodotti della ricerca dell’Ateneo con lo scopo di migliorarne la visibilità e di favorirne l’impatto a livello nazionale e internazionale.

This paper contrasts two important features of parallel system computations: fairness and timing. The study is carried out at specification system level by resorting to a well-known process description language. The language is extended with labels which allow to filter out those process executions that are not (weakly) fair (as in [5,6]), and with upper time bounds for the process activities (as in [2]). We show that fairness and timing are closely related. Two main results are stated. First, we show that each everlasting (or non-Zeno) timed process execution is fair. Second, we provide a characterization for fair executions of untimed processes in terms of timed process executions. This results in a finite representation of fair executions using regular expressions

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11581/116383

Titolo:	Relating Fairness and Timing in Process Algebras
Autori interni:	DI BERARDINI, Maria Rita CORRADINI, Flavio
Data di pubblicazione:	2003
Abstract:	This paper contrasts two important features of parallel system computations: fairness and timing. The study is carried out at specification system level by resorting to a well-known process description language. The language is extended with labels which allow to filter out those process executions that are not (weakly) fair (as in [5,6]), and with upper time bounds for the process activities (as in [2]). We show that fairness and timing are closely related. Two main results are stated. First, we show that each everlasting (or non-Zeno) timed process execution is fair. Second, we provide a characterization for fair executions of untimed processes in terms of timed process executions. This results in a finite representation of fair executions using regular expressions
Handle:	http://hdl.handle.net/11581/116383
ISBN:	9783540407539
Appare nelle tipologie:	Contributo in atto di convegno su volume

File in questo prodotto:

Non ci sono file associati a questo prodotto.

Citazioni
ND

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.