Process algebra for performance evaluation
Theoretical Computer Science
Verification of randomized distributed algorithms
Lectures on formal methods and performance analysis
Testing preorders for probabilistic processes can be characterized by simulations
Theoretical Computer Science
Additive models of probabilistic processes
Theoretical Computer Science
Performance measure sensitive congruences for Markovian process algebras
Theoretical Computer Science
Discrete time generative-reactive probabilistic processes with different advancing speeds
Theoretical Computer Science
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
Verifying Probabilistic Programs Using a Hoare like Logic
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Metrics for Labeled Markov Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Compositional Performance Analysis Using Probabilistic I/O Automata
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Decision Algorithms for Probabilistic Bisimulation
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
Approximating labelled Markov processes
Information and Computation
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Categorical foundations for randomly timed automata
Theoretical Computer Science
Universal aspects of probabilistic automata
Mathematical Structures in Computer Science
On the design of distributed protocols from differential equations
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
The reactive simulatability (RSIM) framework for asynchronous systems
Information and Computation
Specifying and Executing Reactive Scenarios With Lutin
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic bisimulation as a congruence
ACM Transactions on Computational Logic (TOCL)
On the verification of probabilistic I/O automata with unspecified rates
Proceedings of the 2009 ACM symposium on Applied Computing
Compositionality for Markov reward chains with fast and silent transitions
Performance Evaluation
Probabilistic environments in the quantitative analysis of (non-probabilistic) behaviour models
Proceedings of the the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Weighted Bisimulation in Linear Algebraic Form
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Mutation testing from probabilistic and stochastic finite state machines
Journal of Systems and Software
On the Expressive Power of Schedulers in Distributed Probabilistic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Stability of Distributed Algorithms in the Face of Incessant Faults
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Compositionality for Markov reward chains with fast transitions
EPEW'07 Proceedings of the 4th European performance engineering conference on Formal methods and stochastic models for performance evaluation
Probabilistic automata for architecture-based reliability assessment
Proceedings of the 2010 ICSE Workshop on Quantitative Stochastic Models in the Verification and Design of Software Systems
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
Probabilistic congruence for semistochastic generative processes
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Stochastic transition systems for continuous state spaces and non-determinism
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Testing probabilistic distributed systems
FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Probability and nondeterminism in operational models of concurrency
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Probabilistic i/o automata: theories of two equivalences
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Generic forward and backward simulations
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
A case for design methodology research in self-* distributed systems
Self-star Properties in Complex Information Systems
Interval probabilities of state transitions in probabilistic automata
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
Approximate aggregation of Markovian models using alternating least squares
Performance Evaluation
| Hi-index | 5.23 |