scientific article; zbMATH DE number 2038731

MaRDI QIDQ4449196zbMATH OpenFDO

Authors Mariëlle I. A. Stoelinga, F. Vaandrager

Publication date 8 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2719/27190464.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A testing scenario for probabilistic processes
• Testing probabilistic automata
• scientific article; zbMATH DE number 7311343
• Probabilistic bisimilarity as testing equivalence
• scientific article; zbMATH DE number 1231682

Cited in

(7)

• Switched PIOA: parallel composition via distributed scheduling
• Testing probabilistic automata
• A General Testability Theory
• A testing scenario for probabilistic processes
• Introducing complexity to formal testing
• Derivation of a Suitable Finite Test Suite for Customized Probabilistic Systems
• Specification, testing and implementation relations for symbolic-probabilistic systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449196)