Operating system concepts (2nd ed.)
Operating system concepts (2nd ed.)
Probabilistic propositional temporal logics
Information and Control
A probabilistic powerdomain of evaluations
Proceedings of the Fourth Annual Symposium on Logic in computer science
Stochastic Petri nets: an elementary introduction
Advances in Petri nets 1989
Equivalences, congruences, and complete axiomatizations for probabilistic processes
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Bisimulation through probabilistic testing
Information and Computation
Performance modeling of automated manufacturing systems
Performance modeling of automated manufacturing systems
Elements of information theory
Elements of information theory
Acta Informatica
The complexity of probabilistic verification
Journal of the ACM (JACM)
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Axiomatizing probabilistic processes: ACP with generative probabilities
Information and Computation
A compositional approach to performance modelling
A compositional approach to performance modelling
UPPAAL—a tool suite for automatic verification of real-time systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Model-checking of real-time systems: a telecommunications application: experience report
ICSE '97 Proceedings of the 19th international conference on Software engineering
Composition and behaviors of probabilistic I/O automata
Theoretical Computer Science
A probabilistic poly-time framework for protocol analysis
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Bisimulation for probabilistic transition systems: a coalgebraic approach
Theoretical Computer Science
The Metric Analogue of Weak Bisimulation for Probabilistic Processes
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Probabilistic Metric Semantics for a Simple Language with Recursion
MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
Testing Preorders for Probabilistic Processes
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Symbolic Model Checking for Probabilistic Processes
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Compositional Testing Preorders for Probabilistic Processes
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Bisimulation for Labelled Markov Processes
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Quantitative Analysis and Model Checking
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A Logical Characterization of Bisimulation for Labeled Markov Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Approximating Labeled Markov Processes
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Approximating labelled Markov processes
Information and Computation
Trace theory for automatic hierarchical verification of speed-independent circuits
Trace theory for automatic hierarchical verification of speed-independent circuits
Labelled markov processes
An intrinsic characterization of approximate probabilistic bisimilarity
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
A behavioural pseudometric for metric labelled transition systems
CONCUR 2005 - Concurrency Theory
Bisimulation and cocongruence for probabilistic systems
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Approximating and computing behavioural distances in probabilistic transition systems
Theoretical Computer Science
Domain theory, testing and simulation for labelled Markov processes
Theoretical Computer Science - Foundations of software science and computation structures
Recursively defined metric spaces without contraction
Theoretical Computer Science
Proving Approximate Implementations for Probabilistic I/O Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Approximate bisimulation relations for constrained linear systems
Automatica (Journal of IFAC)
Quantifying process equivalence based on observed behavior
Data & Knowledge Engineering
Approximate Simulation Relations for Hybrid Systems
Discrete Event Dynamic Systems
Characterize branching distance in terms of (η,α)-bisimilarity
Information and Computation
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
On metrics for probabilistic systems: Definitions and algorithms
Computers & Mathematics with Applications
ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
Learning the Difference between Partially Observable Dynamical Systems
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II
The Kantorovich Metric in Computer Science: A Brief Survey
Electronic Notes in Theoretical Computer Science (ENTCS)
Metrics for Action-labelled Quantitative Transition Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Bisimulation and cocongruence for probabilistic systems
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Approximating a behavioural pseudometric without discount for probabilistic systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Non-expansive ε-bisimulations for probabilistic processes
Theoretical Computer Science
Measuring anonymity with relative entropy
FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
Timed, distributed, probabilistic, typed processes
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Simulation hemi-metrics between infinite-state stochastic games
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Approximating labelled Markov processes again!
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
The category-theoretic solution of recursive metric-space equations
Theoretical Computer Science
Weak bisimulation for Probabilistic Timed Automata
Theoretical Computer Science
Time for verification
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Theoretical Computer Science
Approximating Markovian testing equivalence
Theoretical Computer Science
Approximate abstraction of stochastic hybrid automata
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Quantifying similarities between timed systems
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
An accessible approach to behavioural pseudometrics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Process equivalence: comparing two process models based on observed behavior
BPM'06 Proceedings of the 4th international conference on Business Process Management
Evaluation of technical measures for workflow similarity based on a pilot study
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
Simulation-Based graph similarity
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Value-passing CCS with noisy channels
Theoretical Computer Science
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
On the complexity of computing probabilistic bisimilarity
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Approximating Markov processes through filtration
Theoretical Computer Science
Bisimulation Metrics for Continuous Markov Decision Processes
SIAM Journal on Computing
Dexter kozen's influence on the theory of labelled markov processes
Logic and Program Semantics
Taking it to the limit: approximate reasoning for markov processes
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Synthesis from incompatible specifications
Proceedings of the tenth ACM international conference on Embedded software
A pseudometric in supervisory control of probabilistic discrete event systems
Discrete Event Dynamic Systems
Bisimulation for Quantum Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Approximate verification and enumeration problems
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
On-the-Fly exact computation of bisimilarity distances
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
The duality of state and observation in probabilistic transition systems
TbiLLC'11 Proceedings of the 9th international conference on Logic, Language, and Computation
Weighted modal transition systems
Formal Methods in System Design
Quantitative timed simulation functions and refinement metrics for real-time systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
Formula-free finite abstractions for linear temporal verification of stochastic hybrid systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
Testing probabilistic equivalence through Reinforcement Learning
Information and Computation
Formalizing and reasoning about quality
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Refinement and difference for probabilistic automata
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
The bisimdist library: efficient computation of bisimilarity distances for markovian models
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Approximating Markov Processes by Averaging
Journal of the ACM (JACM)
Quantitative reactive modeling and verification
Computer Science - Research and Development
Characterization and computation of infinite-horizon specifications over Markov processes
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.01 |
The notion of process equivalence of probabilistic processes is sensitive to the exact probabilities of transitions. Thus, a slight change in the transition probabilities will result in two equivalent processes being deemed no longer equivalent. This instability is due to the quantitative nature of probabilistic processes. In a situation where the process behavior has a quantitative aspect there should be a more robust approach to process equivalence. This paper studies a metric between labelled Markov processes. This metric has the property that processes are at zero distance if and only if they are bisimilar. The metric is inspired by earlier work on logics for characterizing bisimulation and is related, in spirit, to the Hutchinson metric.