Principles and methods of testing finite state machines-a survey

D Lee, M Yannakakis - Proceedings of the IEEE, 1996 - ieeexplore.ieee.org
With advanced computer technology, systems are getting larger to fulfill more complicated
tasks: however, they are also becoming less reliable. Consequently, testing is an …

Modeling and verification of randomized distributed real-time systems

R Segala - 1996 - dspace.mit.edu
Modeling and Veri cation of Randomized Distributed Real-Time Systems Page 1 Modeling and
Veri cation of Randomized Distributed Real-Time Systems by Roberto Segala SM, Electrical …

[图书][B] Formal verification of probabilistic systems

L De Alfaro - 1998 - search.proquest.com
Methods for the formal verification and specification of systems are a critical tool for the
development of correct systems, and they have been applied to the design of hardware …

Reactive, generative, and stratified models of probabilistic processes

RJ VanGlabbeek, SA Smolka, B Steffen - Information and Computation, 1995 - Elsevier
We introduce three models of probabilistic processes, namely, reactive, generative, and
stratified. These models are investigated within the context of PCCS, an extension of …

Model checking for a probabilistic branching time logic with fairness

C Baier, M Kwiatkowska - Distributed Computing, 1998 - Springer
We consider concurrent probabilistic systems, based on probabilistic automata of Segala &
Lynch [55], which allow non-deterministic choice between probability distributions. These …

Model-based testing of object-oriented reactive systems with Spec Explorer

M Veanes, C Campbell, W Grieskamp… - Formal Methods and …, 2008 - Springer
Testing is one of the costliest aspects of commercial software development. Model-based
testing is a promising approach addressing these deficits. At Microsoft, model-based testing …

[PDF][PDF] On algorithmic verification methods for probabilistic systems

C Baier - 1998 - wwwneu.inf.tu-dresden.de
Parallel systems (such as operating systems, telecommunication systems, aircraft controlling
systems, banking systems, etc.) arise in many industrial applications. For applications where …

Weak bisimulation for fully probabilistic processes

C Baier, H Hermanns - … Verification: 9th International Conference, CAV'97 …, 1997 - Springer
Bisimulations that abstract from internal computation have proven to be useful for verification
of compositionally defined transition system. In the literature of probabilistic extensions of …

Just do it: simple monadic equational reasoning

J Gibbons, R Hinze - ACM SIGPLAN Notices, 2011 - dl.acm.org
One of the appeals of pure functional programming is that it is so amenable to equational
reasoning. One of the problems of pure functional programming is that it rules out …

Distinguishing tests for nondeterministic and probabilistic machines

R Alur, C Courcoubetis, M Yannakakis - Proceedings of the twenty …, 1995 - dl.acm.org
We study the problem of uniquely identifying the initial state of a given finite-state machine
from among a set of possible choices, based on the input-output behavior. Equivalently …