Operating system concepts (2nd ed.)
Operating system concepts (2nd ed.)
Probabilistic propositional temporal logics
Information and Control
Trace theory for automatic hierarchical verification of speed-independent circuits
Trace theory for automatic hierarchical verification of speed-independent circuits
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
Bisimulation through probabilistic testing
Information and Computation
Performance modeling of automated manufacturing systems
Performance modeling of automated manufacturing systems
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
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
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
Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
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
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
A Compositional Approach to Performance Modelling (Distinguished Dissertations in Computer Science)
A Compositional Approach to Performance Modelling (Distinguished Dissertations in Computer Science)
Diagnosis with behavioral modes
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Security Analysis of a Probabilistic Non-repudiation Protocol
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Testing Labelled Markov Processes
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Secure Information Flow for Concurrent Processes
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
An Algorithm for Quantitative Verification of Probabilistic Transition Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Weak Bisimulation is Sound and Complete for PCTL*
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Approximating Labeled Markov Processes
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
A behavioural pseudometric for metric labelled transition systems
CONCUR 2005 - Concurrency Theory
Labelled Markov Processes as Generalised Stochastic Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
Quantifying Timing Leaks and Cost Optimisation
ICICS '08 Proceedings of the 10th International Conference on Information and Communications Security
Better Quality in Synthesis through Quantitative Objectives
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
A Formal Framework for User Centric Control of Probabilistic Multi-agent Cyber-Physical Systems
Computational Logic in Multi-Agent Systems
Mean-payoff automaton expressions
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
An accessible approach to behavioural pseudometrics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Measuring and synthesizing systems in probabilistic environments
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
On behavioural pseudometrics and closure ordinals
Information Processing Letters
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
A pseudometric in supervisory control of probabilistic discrete event systems
Discrete Event Dynamic Systems
| Hi-index | 0.00 |
Partial Labeled Markov Chains (plMc) generalize process algebra and traditional Markov chains. They provide a foundation for interacting discrete probabilistic systems. Existing notions of process equivalence are too sensitive to the exact probabilities of transitions in plMcs. This paper studies more robust notions of "approximate" equivalence between plMcs.