Implementation relations for stochastic finite state machines

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

Volumn 4054 LNCS, Issue , 2006, Pages 123-137

  Merayo, Mercedes G ^a   Núñez, Manuel ^a   Rodríguez, Ismael ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; PROBABILITY; RANDOM PROCESSES; STOCHASTIC PROGRAMMING; TIME DOMAIN ANALYSIS;

FINITE STATE MACHINES; IMPLEMENTATION RELATIONS; RANDOM VARIABLES; STOCHASTIC FINITE STATE MACHINES;

FINITE AUTOMATA;

EID: 33746360584     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11777830_9     Document Type: Conference Paper

References (28)

1. [AD94] R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
2. [BG98] M. Bernardo and R. Gorrieri. A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time. Theoretical Computer Science, 202:1-54, 1998.
3. [BG02] M. Bravetti and R. Gorrieri. The theory of interactive generalized semi-Markov processes. Theoretical Computer Science, 282(1):5-32, 2002.
4. [BL97] P. Brémond-Grégoire and I. Lee. A process algebra of communicating shared resources with dense time and priorities. Theoretical Computer Science, 189(1-2):179-219, 1997.
5. [BU91] B.S. Bosik and M.U. Uyar. Finite state machine based formal methods in protocol conformance testing. Computer Networks & ISDN Systems, 22:7-33, 1991.
6. [CCV+03] D. Cazorla, F. Cuartero, V. Valero, F.L. Pelayo, and J.J. Pardo. Algebraic theory of probabilistic and non-deterministic processes. Journal of Logic and Algebraic Programming, 55(1-2):57-103, 2003.
7. [CdAHS03] A. Chakrabarti, L. de Alfaro, T.A. Henzinger, and M. Stoelinga. Resource interfaces. In 3rd Int. Conf. on Embedded Software, EMSOFT 2003, LNCS 2855, pages 117-133. Springer, 2003.
8. [CDSY99] R. Cleaveland, Z. Dayar, S.A. Smolka, and S. Yuen. Testing preorders for probabilistic processes. Information and Computation, 154(2):93-148, 1999.
9. [CGP00] E.M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 2000.
10. [CL97] D. Clarke and I. Lee. Automatic generation of tests for timing constraints from requirements. In 3rd Workshop on Object-Oriented Real-Time Dependable Systems, 1997.
11. [DK05] P.R. D'Argenio and J.-P. Katoen. A theory of stochastic systems part I: Stochastic automata. Information and Computation, 203(1):1-38, 2005.
12. [ED03] A. En-Nouaary and R. Dssouli. A guided method for testing timed input output automata. In TestCom 2003, LNCS 2644, pages 211-225. Springer, 2003.
13. [GSS95] R. van Glabbeek, S.A. Smolka, and B. Steffen. Reactive, generative and stratified models of probabilistic processes. Information and Computation, 121(1):59-80, 1995.
14. [Her98] H. Hermanns. Interactive Markov Chains. PhD thesis, Universität Erlangen-Nürnberg, 1998.
15. [Hil96] J. Hillston. A Compositional Approach to Performance Modelling. Cambridge University Press, 1996.
16. [HNTC99] T. Higashino, A. Nakata, K. Taniguchi, and A. Cavalli. Generating test cases for a timed I/O automaton model. In 12th Workshop on Testing of Communicating Systems, pages 197-214. Kluwer Academic Publishers, 1999.
17. [HR95] M. Hennessy and T. Regan. A process algebra for timed systems. Information and Computation, 117(2):221-239, 1995.
18. [LN01] N. López and M. Núñez. A testing theory for generally distributed stochastic processes. In CONCUR 2001, LNCS 2154, pages 321-335. Springer, 2001.
19. [LNR06] N. López, M. Nüñez, and I. Rodríguez. Specification, testing and implementation relations for symbolic-probabilistic systems. Theoretical Computer Science, 353(1-3):228-248, 2006.
20. [LY96] D. Lee and M. Yannakakis. Principles and methods of testing finite state machines: A survey. Proceedings of the IEEE, 84(8):1090-1123, 1996.
21. [NR01] M. Núñez and I. Rodríguez. PAMR: A process algebra for the management of resources in concurrent systems. In FORTE 2001, pages 169-185. Kluwer Academic Publishers, 2001.
22. [NR02] M. Núñez and I. Rodríguez. Encoding PAMR into (timed) EFSMs. In FORTE 2002, LNCS 2529, pages 1-16. Springer, 2002.
23. [NR03] M. Núñez and I. Rodríguez. Towards testing stochastic timed systems. In FORTE 2003, LNCS 2767, pages 335-350. Springer, 2003.
24. [NS91] X. Nicollin and J. Sifakis. An overview and synthesis on timed process algebras. In Computer Aided Verification'91, LNCS 575, pages 376-398. Springer, 1991.
25. [Núñ03] M. Núñez. Algebraic theory of probabilistic processes. Journal of Logic and Algebraic Programming, 56(1-2):117-177, 2003.
26. [RR88] G.M. Reed and A.W. Roscoe. A timed model for communicating sequential processes. Theoretical Computer Science, 58:249-261, 1988.
27. [SV03] M. Stoelinga and F. Vaandrager. A testing scenario for probabilistic automata. In ICALP 2003, LNCS 2719, pages 464-477. Springer, 2003.
28. [SVD01] J. Springintveld, F. Vaandrager, and P.R. D'Argenio. Testing timed automata. Theoretical Computer Science, 254(1-2):225-257, 2001.