Formal verification of timed properties of randomized distributed algorithms
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Strategic directions in concurrency research
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Model-checking of real-time systems: a telecommunications application: experience report
ICSE '97 Proceedings of the 19th international conference on Software engineering
Process algebra for performance evaluation
Theoretical Computer Science
Verification of randomized distributed algorithms
Lectures on formal methods and performance analysis
Coin Lemmas with Random Variables
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Equational Axioms for Probabilistic Bisimilarity
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Computing Minimum and Maximum Reachability Times in Probabilistic Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Weak Bisimulation is Sound and Complete for PCTL*
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Decision Algorithms for Probabilistic Bisimulation
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Compositional Verification of Randomized Distributed Algorithms
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Probabilistic Temporal Logics via the Modal Mu-Calculus
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
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
A Logic of Probability with Decidable Model-Checking
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
ProbVerus: Probabilistic Symbolic Model Checking
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Decidable Classes of the Verification Problem in a Timed Predicate Logic
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Approximating Labeled Markov Processes
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
Distributed Computing
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
A hierarchy of probabilistic system types
Theoretical Computer Science - Selected papers of CMCS'03
ProbMela and verification of Markov decision processes
ACM SIGMETRICS Performance Evaluation Review
Model checking discounted temporal properties
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
Theoretical Computer Science
A modular approach to defining and characterising notions of simulation
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Probabilistic temporal logics via the modal mu-calculus
Theoretical Computer Science
Stochastic Petri Box Calculus with Discrete Time
Fundamenta Informaticae
Induction for positive almost sure termination
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Branching Bisimulation Congruence for Probabilistic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Towards Performance Prediction of Compositional Models in Industrial GALS Designs
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Fundamenta Informaticae - Application of Concurrency to System Design
Trace Machines for Observing Continuous-Time Markov Chains
Electronic Notes in Theoretical Computer Science (ENTCS)
Partial Order Reduction for Probabilistic Branching Time
Electronic Notes in Theoretical Computer Science (ENTCS)
A modular approach to defining and characterising notions of simulation
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
Rewriting logic and probabilities
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Modeling and analysis of power-aware systems
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Composing systems while preserving probabilities
EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
Towards probabilistic modelling in event-B
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Ten years of performance evaluation for concurrent systems using CADP
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
Mathematical Structures in Computer Science
Branching bisimulation congruence for probabilistic systems
Theoretical Computer Science
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
Proving positive almost-sure termination
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Proving positive almost sure termination under strategies
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Probability and nondeterminism in operational models of concurrency
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Fundamenta Informaticae - Application of Concurrency to System Design
Stochastic Petri Box Calculus with Discrete Time
Fundamenta Informaticae
Modeling and verification of probabilistic actor systems using prebeca
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
| Hi-index | 0.00 |