Results 1 
9 of
9
Measuring the Performance of Asynchronous Systems with PAFAS
, 2002
"... Based on PAFAS (Process Algebra for Faster Asynchronous Systems), a testingbased faster than relation has been developed that compares asynchronous systems according to their worstcase efficiency. While the testing definition is qualitative, we point out that it can also be seen as considering quan ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(Show Context)
Based on PAFAS (Process Algebra for Faster Asynchronous Systems), a testingbased faster than relation has been developed that compares asynchronous systems according to their worstcase efficiency. While the testing definition is qualitative, we point out that it can also be seen as considering quantitative performance measures. Then we adapt the PAFASapproach to a setting, where user behaviour is known to belong to a very specific, but often occurring class of requestresponse behaviours, and show how to determine an asymptotic performance measure for finitestate processes. We discuss a number of examples showing the usefulness of this setting and demonstrating the effect of asynchronicity on the performance measure.
PAFAS at work: Comparing the WorstCase Efficiency of Three Buffer Implementations
 In APAQS 2001
, 2001
"... In this paper, we use PAFAS (Process Algebra for Faster Asynchronous Systems) to compare the worstcase efficiency of three boundedbuffer implementations: Fifo, Pipe and Buff. Fifo implements the buffer as a firstinfirstout queue, Pipe implements the buffer as a pipeline queue and Buff implement ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
In this paper, we use PAFAS (Process Algebra for Faster Asynchronous Systems) to compare the worstcase efficiency of three boundedbuffer implementations: Fifo, Pipe and Buff. Fifo implements the buffer as a firstinfirstout queue, Pipe implements the buffer as a pipeline queue and Buff implements the buffer as circular queue in an array. We contrast our results with those in [1] and [5] which also aim at comparing the three implementations of the bounded buffer according to some efficiency measure. 1
Bisimulation on speed: Lower time bounds
 RAIRO Theoretical Informatics and Applications
, 2004
"... More than a decade ago, Moller and Tofts published their seminal work on relating processes that are annotated with lower time bounds, with respect to speed. Their paper has left open many questions concerning the semantic theory for their suggested bisimulationbased fasterthan preorder, the MT ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
More than a decade ago, Moller and Tofts published their seminal work on relating processes that are annotated with lower time bounds, with respect to speed. Their paper has left open many questions concerning the semantic theory for their suggested bisimulationbased fasterthan preorder, the MTpreorder, which have not been addressed since. The encountered difficulties concern a general compositionality result, a complete axiom system for finite processes, and a convincing intuitive justification of the MTpreorder. This paper solves these difficulties by developing and employing novel tools for reasoning in discretetime process algebra, in particular a general commutation lemma relating the sequencing of action and clock transitions. Most importantly, it is proved that the MT–preorder is fullyabstract with respect to a natural amortized preorder that uses a simple bookkeeping mechanism for deciding whether one process is faster than another. Together these results reveal the intuitive roots of the MTpreorder as a faster–than relation, while testifying to its semantic elegance. This lifts some of the barriers that have so far hampered progress in semantic theories for comparing the speed of processes.
Time and Fairness in a Process Algebra with NonBlocking Reading
, 2008
"... We introduce the first process algebra with nonblocking reading actions for modelling concurrent asynchronous systems, and we do it in two different ways: one is more flexible, the other is simpler since it needs only one type of transitions. We study the impact this new kind of actions have on fai ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
We introduce the first process algebra with nonblocking reading actions for modelling concurrent asynchronous systems, and we do it in two different ways: one is more flexible, the other is simpler since it needs only one type of transitions. We study the impact this new kind of actions have on fairness, liveness and the timing of systems, using Dekker’s mutual exclusion algorithm we already considered in [4] as running example. Regarding some actions as reading, this algorithm satisfies MUTEX liveness already under the assumption of fairness of actions. We demonstrate an interesting correspondence between liveness and the catastrophic cycles that we introduced in [7] when studying the performance of pipelining. Finally, our previous result on the correspondence between timing and fairness [4] scales up to the extended language. 1
2009): Evaluating the Efficiency of Asynchronous Systems with FASE
 In: preproceedings of the 1st Int. Workshop on Quantitative Formal Methods, Eindhoven (The Netherlands
"... ar ..."
(Show Context)
This work is licensed under the Creative Commons Attribution License. An Individualbased Probabilistic Model for Fish Stock Simulation
, 2010
"... c ⃝ F. Buti et al. ..."
(Show Context)
A Framework for the Evaluation of WorstCase System Efficiency
"... In this paper we present FASE (Fast Asynchronous Systems Evaluation), a tool for evaluating worstcase efficiency of asynchronous systems. This tool implements some wellestablished results in the setting of a timed CCSlike process algebra: PAFAS (a Process Algebra for Faster Asynchronous Systems) ..."
Abstract
 Add to MetaCart
(Show Context)
In this paper we present FASE (Fast Asynchronous Systems Evaluation), a tool for evaluating worstcase efficiency of asynchronous systems. This tool implements some wellestablished results in the setting of a timed CCSlike process algebra: PAFAS (a Process Algebra for Faster Asynchronous Systems). Moreover, we discuss some new solutions that are useful to improve the applicability of FASE to concrete meaningful examples. We finally use FASE to evaluate the efficiency of three different implementations of a bounded buffer and compare our results with previous ones obtained when the same implementations have been contrasted according to an efficiency preorder. 1
Creative Commons Attribution License. Automated Analysis of MUTEX Algorithms with FASE ∗
"... This work is licensed under the ..."
(Show Context)
Timed process calculi: from durationless actions to durational ones?
"... Abstract. Several timed process calculi have been proposed in the literature, which mainly differ for the way in which delays are represented. In particular, a distinction is made between integratedtime calculi, in which actions are durational, and orthogonaltime calculi, in which actions are in ..."
Abstract
 Add to MetaCart
Abstract. Several timed process calculi have been proposed in the literature, which mainly differ for the way in which delays are represented. In particular, a distinction is made between integratedtime calculi, in which actions are durational, and orthogonaltime calculi, in which actions are instantaneous and delays are expressed separately. To reconcile the two approaches, in a previous work an encoding from the integratedtime calculus CIPA to the orthogonaltime calculus TCCS was defined, which preserves timed bisimilarity. To complete the picture, in this paper we consider the reverse translation, by examining the modifications to the two calculi that are needed to make an encoding feasible, as well as the behavioral equivalence that is appropriate to preserve. We then introduce an encoding from modified TCCS to modified CIPA, and show that it can only preserve the weak variant of timed bisimilarity. 1