Expressing Processes with Different Action Durations through Probabilities
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Time and Probability in Process Algebra
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
Axiomatizations for Probabilistic Bisimulation
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Metrics for Labeled Markov Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Norm Functions for Probabilistic Bisimulations with Delays
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
An Axiomatization of Probabilistic Testing
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Establishing Qualitative Properties for Probabilistic Lossy Channel Systems: An Algorithmic Approach
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Process Algebra with Probabilistic Choice
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Domain equations for probabilistic processes
Mathematical Structures in Computer Science
Comparative branching-time semantics for Markov chains
Information and Computation
Notes on Generative Probabilistic Bisimulation
Electronic Notes in Theoretical Computer Science (ENTCS)
Proving Approximate Implementations for Probabilistic I/O Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Bisimulation relations for weighted automata
Theoretical Computer Science
A Hierarchy of Equivalences for Probabilistic Processes
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Concurrency, σ -Algebras, and Probabilistic Fairness
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Deriving Syntax and Axioms for Quantitative Regular Behaviours
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
A Quantitative Approach to Noninterference for Probabilistic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Discounting the future in systems theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Process algebras in systems biology
SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
Uniform labeled transition systems for nondeterministic, probabilistic, and stochastic processes
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Quantitative Kleene coalgebras
Information and Computation
Testing probabilistic equivalence through reinforcement learning
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
A coalgebraic perspective on linear weighted automata
Information and Computation
Generic forward and backward simulations
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Trace equivalence characterization through reinforcement learning
AI'06 Proceedings of the 19th international conference on Advances in Artificial Intelligence: Canadian Society for Computational Studies of Intelligence
Weighted probabilistic equivalence preserves ω-regular properties
MMB'12/DFT'12 Proceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Hi-index | 0.00 |