Testing semantics for a probabilistic-timed process algebra

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

Volumn 1231, Issue , 1997, Pages 353-365

  Gregorio Rodríguez, Carlos ^a   Liana Diaz, Luis ^a   Núñiez, Manuel ^a   Palao Gostanza, Pedro ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; INTERACTIVE COMPUTER SYSTEMS; SEMANTICS;

OPERATIONAL SEMANTICS; TESTING EQUIVALENCE; TESTING SEMANTICS; TIMED PROCESS ALGEBRA;

REAL TIME SYSTEMS;

EID: 84875131389     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63010-4_24     Document Type: Conference Paper

References (30)

1. J. C. M. Baeten and J. A. Bergstra. Real time process algebra. Formal Aspects of Computing, 3:142-188, 1993.
2. J.C.M. Baeten, J.A. Bergstra, and S.A. Smolka. Axiomatizing probabilistic processes: ACP with generative probabilities. Information and Computation, 121(2):234-255, 1995.
3. I. Christoff. Testing Equivalences for Probabilistic Processes. PhD thesis, Department of Computer Systems. Uppsala University, 1990.
4. R. Cleaveland, I. Lee, P. Lewis, and S.A. Smolka. A theory of testing for soft real-time processes. In 8th International Conference on Software Engineering and Knowledge Engineering, 1996.
5. R. Cleaveland, S.A. Smolka, and A.E. Zwarico. Testing preorders for probabilistic processes. In 19th ICALP, LNCS 623, pages 708-719, 1992.
6. A. Giacalone, C.-C. Jou, and S.A. Smolka. Algebraic reasoning for probabilistic concurrent systems. In Proceedings of Working Conference on Programming Concepts and Methods, IFIP TC 2, 1990.
7. C. Gregorio, L. Llana, M. Nunez, and P. Palao. Testing semantics for a probabilistic-timed process algebra. Technical Report 49/97, Dpt. Informática у Automática, Universidad Complutense de Madrid, 1997.
8. C. Gregorio and M. Nunez. Specifying and verifying the Alternating Bit Protocol with Probabilistic-Timed LOTOS. In COST 247 International Workshop on Applied Formal Methods in System Design, pages 38-50, 1996.
9. Jan Friso Groote. Transition system specifications with negative premises. Theoretical Computer Science, 118:263-299, 1993.
10. Hans A. Hansson. Time and Probability in Formal Design of Distributed Systems. PhD thesis, Department of Computer Systems. Uppsala University, 1991.
11. M. Hennessy. Algebraic Theory of Processes. MIT Press, 1988.
12. M. Hennessy and T. Regan. A process algebra for timed systems. Information and Computation, 117(2):221-239, 1995.
13. B. Jonsson, C. Ho-Stuart, and W. Yi. Testing and refinement for nonde-terministic and probabilistic processes. In Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863, pages 418-430, 1994.
14. B. Jonsson and W. Yi. Compositional testing preorders for probabilistic processes. In 10th IEEE Symposium on Logic In Computer Science, pages 431-443, 1995.
15. L. Llana, D. de Frutos, and M. Nunez. Testing semantics for urgent timed algebras. In 3rd AM AST Workshop on Real-Time Systems, 1996. G. Lowe. Probabilistic and prioritized models of timed CSP. Theoretical Computer Science, 138:315-352, 1995.
16. K. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(l):l-28, 1991.
17. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
18. M. Nunez and D. de Frutos. Testing semantics for probabilistic LOTOS. In Formal Description Techniques VIII, pages 365-380, 1995.
19. M. Nunez, D. de Frutos, and L. Liana. Acceptance trees for probabilistic processes. In CONCUR'95, LNCS 962, pages 249-263, 1995.
20. X. Nicollin and J. Sifakis. An overview and synthesis on timed process algebras. In Computer Aided Verification'91, LNCS 575, pages 376-398, 1991.
21. M. Núnez. Semánticas de Pruebas para Algebras de Procesos Probabilísticos. PhD thesis, Universidad Complutense de Madrid, 1996. In Spanish.
22. Y. Ortega-Mallén and D. de Frutos. Timed observations: a semantic model for real-time concurrency. In Proceedings of Working Conference on Programming Concepts and Methods, IFIP TC 2, 1990.
23. G.M. Reed and A.W. Roscoe. A timed model for CSP. In 13th ICALP, LNCS 226, pages 314-323, 1986.
24. S. Schneider. An operational semantics for timed CSP. Information and Computation, 116:193-213, 1995.
25. E.W. Stark and S.A. Smolka. A complete axiom system for finite-state probabilistic processes, 1996.
26. C. Tofts. Processes with probabilities, priority and time. Formal Aspects of Computing, 6:536-564, 1994.
27. R. van Glabbeek, S.A. Smolka, and B. Steffen. Reactive, generative and stratified models of probabilistic processes. Information and Computation, 121(l):59-80, 1995.
28. S. Yuen, R. Cleaveland, Z. Dayar, and S.A. Smolka. Fully abstract characterizations of testing preorders for probabilistic processes. In CONCUR'94, LNCS 836, pages 497-512, 1994.
29. W. Yi. CCS+ Time = an interleaving model for real time systems. In 18ih ICALP, LNCS 510, pages 217-228, 1991.
30. W. Yi and K.G. Larsen. Testing probabilistic and nondeterministic processes. In Protocol Specification, Testing and Verification XII, pages 47-61, 1992.