A study on the specification and verification of performance properties: Extended abstract

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1101, Issue , 1996, Pages 306-320

  Chen, Xiao Jun ^a   Corradini, Flavio ^b   Gorrieri, Roberto ^c  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF SUSSEX   (United Kingdom)

^c UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; SEMANTICS; SOFTWARE ENGINEERING; TEMPORAL LOGIC;

CONCURRENT SYSTEMS; EXTENDED ABSTRACTS; HENNESSY-MILNER LOGICS; OPERATIONAL SEMANTICS; PERFORMANCE EQUIVALENCE; PERFORMANCE PROPERTIES; PERFORMANCE-ORIENTED; SPECIFICATION AND VERIFICATION;

ALGEBRA;

EID: 21344443807     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0014324     Document Type: Conference Paper

References (21)

1. L. Aceto and D. Murphy. On the ill-timed but well-caused. In E. Best, editor, CONCUR'93, LNCS 715, pages 97-111. Springer-Verlag, 1993.
2. L. Aceto and D. Murphy. Timing and causality in process algebra. Technical Report 9/93, University of Sussex, 1993. To appear in Acta Informatica.
3. S. Arun-Kumar and M. Hennessy. An efficient preorder for processes. Acta Informatica, 29:737-760, 1992.
4. S. Brooks and W. Rounds. Behavioural equivalence relations induced by programming logics. In LNCS 154, pages 97-108. Springer-Verlag, 1983.
5. R. Cleaveland. Tableau-based model checking in the propositional μ-calculus. Acta Informatica, 27:725-747, 1990.
6. R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: A semantics-based tool for the verification of concurrent systems. ACM Transaction on Programming Languages and Systems, 15:36-72, 1993.
7. F. Corradini. Compositionality for processes with durational actions. In Proc. Fifth Italian Conference on Theoretical Computer Science, 1995.
8. F. Corradini, R. Gorrieri, and M. Roccetti. Performance preorder and competitive equivalence. Technical Report 95/01, University of Bologna, 1995.
9. F. Corradini, R. Gorrieri, and M. Roccetti. Performance preorder: Ordering processes with respect to speed. In MFCS'95, LNCS 969, pages 444-453, 1995.
10. E.A. Emerson and J.Y. Halpern. "Sometimes" and "Not Never" revisited: on branching time versus linear time temporal logic. Journal of ACM, 33(1):151-178, 1986.
11. G-L. Ferrari and U. Montanari. Dynamic matrices and the cost analysis of concurrent programs. In AMAST'95, 1995.
12. R. Gorrieri and M. Roccetti. Towards performance evaluation in process algebras. In AMAST'93, pages 289-296. Springer-Verlag, 1993.
13. R. Gorrieri, M. Roccetti, and E. Stancampiano. A theory of processes with durational actions. Theoretical Computer Science, 140(1):73-94, 1995.
14. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. J. of ACM, 32(1):137-161, 1985.
15. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333-354, 1983.
16. Z. Manna and A. Pnueli. The anchored version of the temporal framework. In J. de Bakker, P. de Roever, and G. Rozenberg, editors, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354, pages 201-284. Springer-Verlag, 1989.
17. R. Milner. Communication and Concurrency. Prentice Hall International, 1989. International Series on Computer Science.
18. F. Moller and C. Tofts. Relating processes with respect to speed. In CONCUR'91, LNCS 527, pages 424-438, 1991.
19. R. De Nicola and V. Vaandrager. Three logics for branching bisimulation. Journal of ACM, 42(2):458-487, 1995.
20. C.Stirling. Modal and temporal logics. In Handbook of Logic in Computer Science, Volume 2, pages 477-563. Oxford University Press, 1992.
21. W. Vogler. Faster asynchronous systems. In Proc. CONCUR'95, LNCS 962, pages 299-312. Springer, 1995.