Skip to main navigation Skip to search Skip to main content

Testing preorders for probabilistic processes

  • North Carolina State University
  • Johns Hopkins University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

51 Scopus citations

Abstract

We present a testing preordez for probabillstic processes based on the natural notion of a process passing a test with a certain probability. The theory enjoys dose connections with the classical testing theory of Hennessy and DeNieola in that whenever a process passes a test with probabillty 1 (respectively some non-0 probability) in our setting, then the process must (respectively may) pass the test in the elassleal theory. In addition, we develop an alternative characterisation of the probabilistic testing preordex that is based on the “must sets” characterizatlon of De Nicola. Finally, we extend our theory of testing to substochestic processes, in which the sum of the probabilities ofa process’s outgoing transitions may be strictly less than 1, with the deficit representing the process’ capacity for undefined behavior. A simple example involving the construction of pipelines from faulty buffer cells is given to illustrate how substochastic processes, and the resulting preorder, can be used to model fault-tolerant systems and to reason about system reliability.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 19th International Colloquium, Proceedings
EditorsWerner Kuich
PublisherSpringer Verlag
Pages708-719
Number of pages12
ISBN (Print)9783540557197
DOIs
StatePublished - 1992
Event19th International Colloquium on Automata, Languages, and Programming, ICALP 1992 - Wien, Austria
Duration: Jul 13 1992Jul 17 1992

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume623 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference19th International Colloquium on Automata, Languages, and Programming, ICALP 1992
Country/TerritoryAustria
CityWien
Period07/13/9207/17/92

Fingerprint

Dive into the research topics of 'Testing preorders for probabilistic processes'. Together they form a unique fingerprint.

Cite this