L. Jenner and W. Vogler. Fast asynchronous systems in dense time. In Proc. of ICALP'96, LNCS 1099:75-86, 1996. To appear in Theoretical Comput. Sci. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Theory of Efficiency for Markovian Processes - Bernardo, Cleaveland (2000) (Correct)
....operator and a timeout operator are present. Predictability, which is more appropriate than speed for judging real time systems, is formalized as the difference of the worst case performance from the best case performance of a process w.r.t. tests. Outside the process algebra community we mention [42, 43, 25], which, like [12] are based on a non interleaving framework. In this work, a testing preorder for timed Petri nets is studied where the duration of transitions may vary from execution to execution and is actually fixed by the tester. Both synchronous and asynchronous systems are considered in ....
L. Jenner, W. Vogler, "Fast Asynchronous Systems in Dense Time", in Proc. of the 23rd Int. Coll. on Automata, Languages and Programming (ICALP '96), LNCS 1099:75-86, Paderborn (Germany), 1996
PAFAS at work: Comparing the Worst-Case Efficiency of - Three Buffer Implementations Self-citation (Vogler) (Correct)
....worst case efficiency of three bounded buffer implementations: Fifo, Pipe and Buff. Fifo implements the buffer as a first in first out 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 [2] and [10] which also aim at comparing the three implementations of the bounded buffer according to some efficiency measure. 1. Introduction Recently, PAFAS has been proposed as a useful tool for comparing the worst case efficiency of asynchronous systems [11, 6] PAFAS is a CCS like process description ....
....the preorder for finitestate processes. Furthermore, the preorder is independent of the choice to let time progress in a continuous or discrete way; therefore, we only consider discrete time in this paper. These ideas and results were originally successfully studied within the Petri net formalism [16, 10]. We refer the reader to [6] for more details and results on PAFAS. This paper shows the applicability of PAFAS to concrete meaningful examples. We consider three different implementations of a bounded buffer and relate them according to the above mentioned efficiency preorder. The three ....
L. Jenner and W. Vogler. Fast asynchronous systems in dense time. In Proc. of ICALP'96, LNCS 1099:75-86, 1996. To appear in Theoretical Comput. Sci.
Measuring the Performance of Asynchronous Systems with PAFAS - Corradini, Vogler (2002) Self-citation (Vogler) (Correct)
....inclusion of some kind of refusal traces. It has also been shown that the preorder is independent of the choice to regard time as continuous or discrete; therefore, we only consider discrete time in this paper. These ideas and results were originally successfully studied in the Petri net formalism [Vog95, JV01]. We refer the reader to [CVJ00] for more details and results on PAFAS. The testing approach is qualitative in the sense that a timed test is either satis ed or not and that one system is faster than another or not. But often a quantitative performance measure seems more attractive: such a ....
....5 Conclusion This paper follows a line of research about the eciency of asynchronous systems, modelled as timed systems where activities have upper but no lower time bounds. In this line, the classical testing approach of [DNH84] has been re ned to timed testing, rst in a Petri net setting, in [Vog95, JV01, BV98] and the resulting testing preorder is a suitable faster than relation. This was translated to process algebra in [JV99, CVJ00] Recently, a corresponding bisimulation based faster than relation was studied in [LV01] Upper time bounds have also been studied in the area of distributed algorithms, ....
L. Jenner and W. Vogler. Fast asynchronous systems in dense time. Theoret. Comput. Sci., 254:379-422, 2001.
Efficiency of Asynchronous Systems, Read Arcs, and the.. - Vogler (1997) Self-citation (Vogler) (Correct)
....formally what a solution to the MUTEXproblem is. It is shown that one of our solutions indeed satisfies this specification and that ordinary nets without read arcs cannot solve the MUTEX problem. 1 Introduction The testing scenario of De Nicola and Hennessy [DNH84] has been developed further in [Vog95b, Vog95c, JV96] in order to compare the temporal efficiency of asynchronous systems using Petri nets as system models. This approach is applied here to two solutions of the mutual exclusion problem (MUTEX problem) based on token passing. The corresponding nets contain what we call read arcs, and one of our ....
....extend this argument when comparing the new behaviour notion to fairness. It turns out that, for the testing scenario of [Vog95c] the implementation preorder is a sensible faster than relation. While in [Vog95c] a discrete time scale is used, the same idea of efficiency testing is studied in [JV96] using a dense time scale. Three variants are considered and each of them is shown to coincide with a discretely timed version; one of the variants is the one from [Vog95c] We will consider here another of the three variants, which is probably the most simple one: in this variant, transitions ....
[Article contains additional citation context not shown here]
L. Jenner and W. Vogler. Fast asynchronous systems in dense time. In F. Meyer auf der Heide and B. Monien, editors, Automata, Languages and Programming ICALP'96, Lect. Notes Comp. Sci. 1099, 75--86. Springer, 1996.
Modular Construction of Fast Asynchronous Systems - Jenner (1996) Self-citation (Jenner) (Correct)
....indeterminate relative speeds. Usually, this is interpreted as: components may idle unnecessarily or actions may take more time than necessary; under this interpretation, the worst case behaviour is to idle until time D is up and, thus, no test at all is satisfied. Nevertheless, based on [Vog95b] [JV95] develops a scenario of efficiency testing for asynchronous systems and studies the corresponding faster than relation. This scenario is based on a different interpretation of asynchronous systems: it is assumed that the components are guaranteed to perform each enabled action within one unit of ....
....of time with its current action; instead all other components may work very fast in comparison. Under this interpretation, the relative speeds of the components are still arbitrary, i.e. we really get a theory for asynchronous systems; this idea goes back to at least [LF81] The basic variant of [JV95] assumes one unit of dense time for activation and occurrencetime together; this approach seems appealing since it treats places (activation) and transitions (occurrence) of a net on an equal footing; a disadvantage is the technically complicated characterization of the resulting testing ....
[Article contains additional citation context not shown here]
L. Jenner and W. Vogler. Fast asynchronous systems in dense time. Technical Report Nr. 344, Inst. f. Mathematik, Univ. Augsburg, 1995. Extended abstract to appear in Proc. ICALP 96.
Further Studies on Timed Testing of Concurrent Systems - Jenner (1998) Self-citation (Jenner) (Correct)
....# # # # EL c EL ( DL) SL c SL ( ML) The following and no other implications hold in general between inclusion of discrete and continuous behaviour of two timed nets: LL c LL AL c AL EL c EL SL c SL 3. 21 4 Timed Testing in Discrete and Continuous Time Timed testing ([Vog95, JV95]) is a modification of classical testing ( DNH84] the qualitative problem may must some behaviour occur is quantitatively refined to may must some behaviour occur in time . Technically, the timed testing scenario is set up as follows. A timed test consists of an observer O and a time ....
L. Jenner and W. Vogler. Fast asynchronous systems in dense time. Technical Report Nr. 344, Inst. f. Mathematik, Univ. Augsburg, 1995. Available at http://www1.Informatik.Uni-Augsburg.DE/žjenner/. Extended abstract appeared in Proc. ICALP 96.
Comparing the Efficiency of Asynchronous Systems - Jenner, Vogler (1999) Self-citation (Jenner Vogler) (Correct)
....system. e.g. Lyn96] uses upper time bounds for asynchronous systems in the area of distributed algorithms. e mail: fjenner, voglerg informatik.uni augsburg.de We compare processes via the testing approach developed by [DNH84] and extended to timed testing in a Petri net framework in [Vog95, JV95], where a timed test is an environment together with a time bound. A process is embedded into the environment essentially via parallel composition and satisfies a timed test, if success is reached before the time bound in every run of the composed system, i.e. even in the worst case. If some ....
....an implication but an equivalence. The refined efficiency preorder is then shown to be the coarsest precongruence for all operators of our process algebra that respects inclusion of discrete behaviour and is a precongruence also for recursion. We have translated the results for Petri nets from [JV95] to a process algebra setting for two reasons: on the one hand, it is shown that the underlying ideas are not model dependent; on the other hand, the developments here are quite different, in particular since process algebras are much more powerful than finite safe Petri nets; see e.g. the ....
[Article contains additional citation context not shown here]
L. Jenner and W. Vogler. Fast asynchronous systems in dense time. Technical Report Nr. 344, Inst. f. Mathematik, Univ. Augsburg, 1995. Available at http://www1.Informatik.Uni-Augsburg.DE/žjenner/. Extended abstract appeared in Proc. ICALP 96.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC