Abstract
We propose a structural operational semantics that expresses temporal aspects of mobile and distributed systems, each sequential component of which has its local clock. Since the run-time support of a programming language implements the operations of the language via some lower-level routines, the same action, put in different contexts, may have different durations. Also the network topology affects these durations, typically when messages are exchanged. We model this through a transition system labelled by actions and their costs, in a discrete time. Then, we define two performance preordings that say when the execution of a process is faster than that of another. The first preorder is similar to those presented in the literature, while the second refines it in that it considers a process faster than another if it is such from some point onwards of its execution. Finally, as an example we compare the performance of a conventional uniprocessor architecture with a prefetch pipeline architecture.
Work partially supported by ESPRIT BRA n. 8130 — LOMAPS.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L. Aceto and D. Murphy. Timing and causality in process algebra. Technical Report 9/93, University of Sussex, 1993.
R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183–236, 1994.
J.C.M Baeten and J.A. Bergstra. Real-time process algebra. Technical Report CS-R9053, Centre for Mathematics and Computer Science, Amsterdam, 1990.
A. Bianchi, S. Coluccini, P. Degano, and C. Priami. An efficient verifier of truly concurrent properties. In V. Malyshkin, editor, Proceedings of PaCT'95, LNCS 964, pages 36–50. Springer-Verlag, 1995.
Roberta Borgia, Pierpaolo Degano, Corrado Priami, Lone Leth, and Bent Thomsen. Understanding mobile agents via a non-interleaving semantics for facile. Technical Report ECRC-96-4, European Computer-Industry Research Centre, 1996.
G. Boudol and I. Castellani. A non-interleaving semantics for CCS based on proved transitions. Fundamenta Informaticae, XI(4):433–452, 1988.
F. Corradini, R. Gorrieri, and M. Roccetti. Performance preordering: ordering processes with respect to speed. In Proceedings of MFCS95, LNCS 969, 1995.
P. Degano, R. De Nicola, and U. Montanari. Partial ordering derivations for CCS. In Proceedings of FCT, LNCS 199, pages 520–533. Springer-Verlag, 1985.
P. Degano and C. Priami. Proved trees. In Proceedings of ICALP'92, LNCS 623, pages 629–640. Springer-Verlag, 1992.
P. Degano and C. Priami. Causality for mobile processes. In Proceedings of ICALP'95, LNCS 944, pages 660–671. Springer-Verlag, 1995.
P. Degano and C. Priami. Enhanced operational semantics. ACM Computing Surveys, 28(2):352–354, 1996.
G. Ferrari and U. Montanari. Dynamic matrices. In Proceedings of AMAST'95, LNCS 936. Springer-Verlag, 1995.
R. Gorrieri and M. Roccetti. Towards performance evaluation in process algebras. In Proceedings of AMAST'93, LNCS. Springer Verlag, 1993.
R. Gorrieri, M. Roccetti, and E. Stancapiano. A theory of processes with durational actions. Theoretical Computer Science, (140), 1994.
E. Goubault. Durations for truly concurrent transitions. In Proceedings of ESOP96, LNCS 1058, pages 173–187, 1995.
M. Hennessy and T. Regan. A temporal process algebra. Technical Report 2/90, University of Sussex, 1990.
Andrea Maggiolo-Schettini and Adriano Peron. A graph rewriting framework for statecharts semantics. In J. Cuny, H. Ehrig, G. Engels, and G. Rozenberg, editors, Proc. Fifth Intl. Workshop on Graph Grammars and Their Application to Comp. Sci., volume 1073 of Lecture Notes in Computer Science, pages 107–121. Springer, 1996.
Andrea Maggiolo-Schettini and Józef Winkowski. Towards an algebra for timed behaviours. Theeoretical Computer Science, 103(2):335–363, 1992.
R. Milner. The polyadic π-calculus: a tutorial. Technical Report ECS-LFCS-91-180, University of Edinburgh, 1991.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes (I and II). Information and Computation, 100(1):1–77, 1992.
F. Moller and C. Tofts. A temporal calculus of communicating processes. In Proceedings of CONCUR'90, LNCS 458. Springer-Verlag, 1990.
X. Nicollin and J. Sifakis. An overview and synthesis on timed process algebras. In Real Time: Theory in Practice, LNCS 600, pages 526–548. Springer-Verlag, 1991.
G.M. Reed and A.W. Roscoe. A timed model for communicating sequential processes. Theoretical Computer Science, pages 249–261, 1988.
Y.Wang. Real-time behaviour of asynchronous agents. In J.C.M. Beaten and J.W. Klop, editors, Proceedings of CONCUR'90, LNCS 458. Springer Verlag, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Degano, P., Loddo, JV., Priami, C. (1997). Mobile processes with local clocks. In: Dam, M. (eds) Analysis and Verification of Multiple-Agent Languages. LOMAPS 1996. Lecture Notes in Computer Science, vol 1192. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62503-8_14
Download citation
DOI: https://doi.org/10.1007/3-540-62503-8_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62503-2
Online ISBN: 978-3-540-68052-9
eBook Packages: Springer Book Archive