Specification and verification of timed lazy systems

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

Volumn 1113, Issue , 1996, Pages 279-290

  Corradini, Flavio ^a   Pistore, Marco ^b  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER PROGRAMMING LANGUAGES;

BISIMULATIONS; EXTERNAL STIMULUS; INFINITE TRANSITION GRAPHS; NATURAL EXTENSION; OPERATIONAL SEMANTICS; PERFORMANCE EQUIVALENCE; PERFORMANCE OF SYSTEMS; SPECIFICATION AND VERIFICATION;

SEMANTICS;

EID: 84947901345     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61550-4_155     Document Type: Conference Paper

References (15)

1. L. Aceto and D. Murphy. On the ill-timed but well-caused. In 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. F. Corradini. Compositionality for processes with durational actions. In ICTCS’95, World Scientific, 1995.
5. F. Corradini, R. Gorrieri and M. Roccetti. Performance preorder and competitive equivalence. Technical Report 95/01, University of Bologna, 1995.
6. 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.
7. F. Corradini and M. Pistore. Specification and Verification of Timed Systems. Technical Report 96/107, University of L’Aquila, 1996.
8. R. De Nicola and M. Hennessy: Testing Equivalences for Processes. Theoretical Computer Science, 34, pages 83-133, 1984.
9. 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.
10. G-L. Ferrari and U. Montanari. Dynamic matrices and the cost analysis of concurrent programs. In AMAST’95, LNCS 936. Springer Verlag, 1995.
11. R. Gorrieri and M. Roccetti. Towards performance evaluation in process algebras. In AMAST’93, pages 289-296. Springer-Verlag, 1993.
12. R. Gorrieri, M. Roccetti and E. Stancampiano. A theory of processes with durational actions. Theoretical Computer Science, 140(1):73-94, 1995.
13. 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.
14. R. Milner. Communication and Concurrency. Prentice Hall International, 1989. International Series on Computer Science.
15. F. Moller and C. Tofts. Relating processes with respect to speed. In CONCUR’91, LNCS 527, pages 424-438. Springer Verlag, 1991.