Approximate reasoning for real-time probabilistic processes

  title={Approximate reasoning for real-time probabilistic processes},
  author={Vineet Gupta and Radha Jagadeesan and P. Panangaden},
  journal={First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings.},
  • Vineet GuptaR. JagadeesanP. Panangaden
  • Published 24 May 2005
  • Computer Science, Mathematics
  • First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings.
We develop a pseudo-metric analogue of bisimulation for generalized semiMarkov processes. The kernel of this pseudo-metric corresponds to bisimulation; thus we have extended bisimulation for continuous-time probabilistic processes to a much broader class of distributions than exponential distributions. This pseudo-metric gives a useful handle on approximate reasoning in the presence of numerical information - such as probabilities and time - in the model. We give a fixed point characterization… 

Topologies of Stochastic Markov Models: Computational Aspects

In this paper we propose two behavioral distances that support approximate reasoning on Stochastic Markov Models (SMMs), that are continuous-time stochastic transition systems where the residence

An Algorithm to Quantify Behavioural Similarity between Probabilistic Systems

This thesis presents the first algorithm to approximate distances in the undiscounted setting and thereby solve a problem which had been open since 1999 and is a key ingredient of Tarski’s decision procedure for the first order theory over reals.

Proving Approximate Implementations for Probabilistic I/O Automata

Approximate Simulations for Task-Structured Probabilistic I/O Automata

A new kind of approximate simulation between task-PIOAs is proposed and it is proved that it is sound with respect to approximate implementations.

Bisimulation for Feller-Dynkin Processes

Behavioural Preorders on Stochastic Systems - Logical, Topological, and Computational Aspects

This work introduces a logical formalism for reasoning about upper and lower bounds on time, and studies the properties of this formalism, including axiomatisation and algorithms for checking when a formula is satisfied, and considers the question of when a system is faster than another system.

Quantifying Similarities Between Timed Systems

We define quantitative similarity functions between timed transition systems that measure the degree of closeness of two systems as a real, in contrast to the traditional boolean yes/no approach to

Approximating and computing behavioural distances in probabilistic transition systems

On behavioural pseudometrics and closure ordinals

A unified framework for differential aggregations in Markovian process algebra



The metric analogue of weak bisimulation for probabilistic processes

A metric analogue of weak bisimulation is developed and it is shown that quantitative properties of interest are continuous with respect to the metric, which says that if two processes are close in the metric then observable quantitative propertiesof interest are indeed close.

Bisimulation for Labeled Markov Processes

In this paper we introduce a new class of labeled transition systems-Labeled Markov Processes-and deene bisimulation for them. Labeled Markov processes are probabilistic labeled transition systems

Bisimulation for labelled Markov processes

The main result is that a notion of bisimulation for Markov processes on Polish spaces, which extends the Larsen-Skou definition for discrete systems, is indeed an equivalence relation.

The theory of interactive generalized semi-Markov processes

Metrics for labelled Markov processes

Testing Preorders for Probabilistic Processes

The theory of testing is extended to substochastic processes, in which the sum of the probabilities of a process's outgoing transitions may be strictly less than 1, with the deficit representing the process' capacity for undefined behavior.

Continuity of Generalized Semi-Markov Processes

It is shown that sequences of generalized semi-Markov processes converge in the sense of weak convergence of random functions if associated sequences of defining elements (initial distributions, transition functions and clock time distributions) converge, and properties of invariant measures can be deduced from convenient approximations.

Weak Bisimulation for Probabilistic Systems

It is shown that in order to compute weak bisimulation it is sufficient to restrict attention to only a finite number of these computations, and an algorithm is presented which has polynomial-time complexity in the number of states of the transition system.

Approximate Symbolic Model Checking of Continuous-Time Markov Chains

A symbolic approximate method for solving the integrals using MTDDs (multi-terminal decision diagrams), a generalisation of MTBDDs, suitable for numerical integration using quadrature formulas based on equally-spaced abscissas, like trapezoidal, Simpson and Romberg integration schemes.

An Algorithm for Quantitative Verification of Probabilistic Transition Systems

An algorithm is given, based on linear programming, to calculate the distance between two states up to prescribed degree of accuracy and yields a quantitative notion of behavioural equivalence.