Abstract
In this paper CCS is equipped with a simple operational semantics that allows us to describe and reason about the performance of systems which proceed by reacting to external stimuli. Based on the new operational semantics, lazy performance equivalence is introduced as a natural extension of the standard interleaving bisimulation. It turns out to be preserved by all CCS contexts.
The problem of automatically checking lazy performance equivalence is also tackled. Because of the lazy character of our calculus, an infinite transition graph is associated with every non-trivial CCS term. Nevertheless, lazy performance equivalence can be provided with an alternative finite characterization and existing algorithms for checking bisimulation based semantics can be applied to the latter.
Research supported by CEE HCM “EXPRESS”, by Esprit Basic Research project CONFER and by CNR.
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. On the ill-timed but well-caused. In CONCUR'93, LNCS 715, pages 97–111. Springer-Verlag, 1993.
L. Aceto and D. Murphy. Timing and causality in process algebra. Technical Report 9/93, University of Sussex, 1993. To appear in Acta Informatica.
S. Arun-Kumar and M. Hennessy. An efficient preorder for processes. Acta Informatica, 29:737–760, 1992.
F. Corradini. Compositionality for processes with durational actions. In ICTCS'95, World Scientific, 1995.
F. Corradini, R. Gorrieri and M. Roccetti. Performance preorder and competitive equivalence. Technical Report 95/01, University of Bologna, 1995.
F. Corradini, R. Gorrieri and M. Roccetti. Performance preorder: Ordering processes with respect to speed. In MFCS'95, LNCS 969, pages 444–453. Springer Verlag 1995.
F. Corradini and M. Pistore. Specification and Verification of Timed Systems. Technical Report 96/107, University of L'Aquila, 1996.
R. De Nicola and M. Hennessy: Testing Equivalences for Processes. Theoretical Computer Science, 34, pages 83–133, 1984.
G-C. Fernandez and L. Mounier. “On-the-fly” verification of behavioural equivalences and preorders. In CAV'91, LNCS 575, pages 181–191. Springer Verlag, 1992.
G-L. Ferrari and U. Montanari. Dynamic matrices and the cost analysis of concurrent programs. In AMAST'95, LNCS 936. Springer Verlag, 1995.
R. Gorrieri and M. Roccetti. Towards performance evaluation in process algebras. In AMAST'93, pages 289–296. Springer-Verlag, 1993.
R. Gorrieri, M. Roccetti and E. Stancampiano. A theory of processes with durational actions. Theoretical Computer Science, 140(1):73–94, 1995.
P.C. Kanellakis and S.C. Smolka. CCS expressions, finite state processes and three problem of equivalence. In Second ACM Symposium on Principles of Distributed Computing, 1983.
R. Milner. Communication and Concurrency. Prentice Hall International, 1989. International Series on Computer Science.
F. Moller and C. Tofts. Relating processes with respect to speed. In CONCUR'91, LNCS 527, pages 424–438. Springer Verlag, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Corradini, F., Pistore, M. (1996). Specification and verification of timed lazy systems. In: Penczek, W., Szałas, A. (eds) Mathematical Foundations of Computer Science 1996. MFCS 1996. Lecture Notes in Computer Science, vol 1113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61550-4_155
Download citation
DOI: https://doi.org/10.1007/3-540-61550-4_155
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61550-7
Online ISBN: 978-3-540-70597-0
eBook Packages: Springer Book Archive