Testing of Symbolic-Probabilistic Systems

[1]  Manuel Núñez,et al.  Applying Formal Methods: Testing, Performance, and M/E-Commerce , 2004, Lecture Notes in Computer Science.

[2]  M. Núñez,et al.  Formal Specification of Symbolic-Probabilistic Systems , 2004, FORTE Workshops.

[3]  Adam Wolisz,et al.  Formal Techniques for Networked and Distributed Systems - FORTE 2003 , 2003, Lecture Notes in Computer Science.

[4]  Manuel Núñez,et al.  Towards Testing Stochastic Timed Systems , 2003, FORTE.

[5]  Frits W. Vaandrager,et al.  A Testing Scenario for Probabilistic Automata , 2003, ICALP.

[6]  Manuel Núñez,et al.  Algebraic theory of probabilistic processes , 2003, J. Log. Algebraic Methods Program..

[7]  Valentín Valero Ruiz,et al.  Algebraic theory of probabilistic and nondeterministic processes , 2003, J. Log. Algebraic Methods Program..

[8]  Jos C. M. Baeten,et al.  Process Algebra with Timing , 2002, Monographs in Theoretical Computer Science. An EATCS Series.

[9]  Thomas J. Ostrand,et al.  Black‐Box Testing , 2002 .

[10]  Jan Tretmans,et al.  Testing Concurrent Systems: A Formal Approach , 1999, CONCUR.

[11]  Roberto Segala,et al.  Testing Probabilistic Automata , 1996, CONCUR.

[12]  David de Frutos-Escrig,et al.  Testing Semantics for Probabilistic LOTOS , 1995, FORTE.

[13]  Rance Cleaveland,et al.  Testing Preorders for Probabilistic Processes , 1992, Inf. Comput..

[14]  Wang Yi,et al.  Testing Probabilistic and Nondeterministic Processes , 1992, PSTV.

[15]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[16]  Joseph Sifakis,et al.  An Overview and Synthesis on Timed Process Algebras , 1991, CAV.

[17]  Ivan Christoff,et al.  Testing Equivalences and Fully Abstract Models for Probabilistic Processes , 1990, CONCUR.

[18]  Bernhard Steffen,et al.  Reactive, generative, and stratified models of probabilistic processes , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[19]  C. A. Petri,et al.  Concurrency Theory , 1986, Advances in Petri Nets.

[20]  A. W. Roscoe,et al.  A Timed Model for Communicating Sequential Processes , 1986, Theor. Comput. Sci..

[21]  Carl A. Sunshine,et al.  Protocol Specification, Testing and Verification - Guest Editorial , 1982, Comput. Networks.

[22]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[23]  Glenford J. Myers,et al.  Art of Software Testing , 1979 .

[24]  Keith A. Bartlett,et al.  A note on reliable full-duplex transmission over half-duplex links , 1969, Commun. ACM.

[25]  Manuel Núñez,et al.  An Overview of Probabilistic Process Algebras and their Equivalences , 2004, Validation of Stochastic Systems.

[26]  I. Laguna.  Especificación de sistemas concurrentes usando conceptos de teoría económica: sintaxis, semántica, aplicaciones y extensiones del lenguaje formal pamr , 2004 .

[27]  Christel Baier,et al.  Validation of Stochastic Systems , 2004, Lecture Notes in Computer Science.

[28]  Mario Bravetti,et al.  Discrete time generative-reactive probabilistic processes with different advancing speeds , 2003, Theor. Comput. Sci..

[29]  Wang Yi,et al.  Probabilistic Extensions of Process Algebras , 2001, Handbook of Process Algebra.

[30]  Rance Cleaveland,et al.  Priority in Process Algebra , 2001, Handbook of Process Algebra.

[31]  Jan Tretmans,et al.  Test Generation with Inputs, Outputs and Repetitive Quiescence , 1996, Softw. Concepts Tools.

[32]  Gregor von Bochmann,et al.  Formal Description Techniques VIII , 1996, IFIP Advances in Information and Communication Technology.

[33]  Julian Bradfield.  CONCUR '96: Concurrency Theory , 1996 .

[34]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[35]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..