Formal verification of timed properties of randomized distributed algorithms
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Stochastic processes as concurrent constraint programs
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the generalized dining philosophers problem
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Partial correctness for probabilistic demonic programs
Theoretical Computer Science
Verification of randomized distributed algorithms
Lectures on formal methods and performance analysis
A Timed Verification of the IEEE 1394 Leader Election Protocol
Formal Methods in System Design
Performance measure sensitive congruences for Markovian process algebras
Theoretical Computer Science
Discrete time generative-reactive probabilistic processes with different advancing speeds
Theoretical Computer Science
Performance evaluation with temporal rewards
Performance Evaluation - Unified specification and performance evaluation using stochastic process algebras
Token-based self-stabilizing uniform algorithms
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Games, Probability, and the Quantitative µ-Calculus qMµ
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
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
Coin Lemmas with Random Variables
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
MoDeST - A Modelling and Description Language for Stochastic Timed Systems
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reachability Analysis of Probabilistic Systems by Successive Refinements
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second 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
Verifying Randomized Byzantine Agreement
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Metrics for Labeled Markov Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Computing Minimum and Maximum Reachability Times in Probabilistic Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Weak Bisimulation for Probabilistic Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Compositional Methods for Probabilistic 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
Decision Algorithms for Probabilistic Bisimulation
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Probabilistic Asynchronous pi-Calculus
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
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
Quantitative Observables and Averages in Probabilistic Constraint Programming
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Cross-Over Composition - Enforcement of Fairness under Unfair Adversary
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
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
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
Tight Space Self-stabilizing Uniform l-Mutual Exclusion
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Deductive Verification of Probabilistic Real-Time Systems
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
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
A compositional approach to defining logics for coalgebras
Theoretical Computer Science - Selected papers of CMCS'03
On probabilistic program equivalence and refinement
CONCUR 2005 - Concurrency Theory
Abstract interpretation of programs as Markov decision processes
Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
A theory of stochastic systems: part I: Stochastic automata
Information and Computation
Distributing probability over non-determinism
Mathematical Structures in Computer Science
Quantitative information in the tuple space coordination model
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Performance analysis of probabilistic timed automata using digital clocks
Formal Methods in System Design
Branching bisimulation for probabilistic systems: characteristics and decidability
Theoretical Computer Science - Expressiveness in concurrency
A modular approach to defining and characterising notions of simulation
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Coupling and self-stabilization
Distributed Computing - Special issue: DISC 04
Probabilistic event structures and domains
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Results on the quantitative μ-calculus qMμ
ACM Transactions on Computational Logic (TOCL)
Statistical probabilistic model checking with a focus on time-bounded properties
Information and Computation
Switched PIOA: parallel composition via distributed scheduling
Theoretical Computer Science - Components and objects
Axiomatizations for probabilistic finite-state behaviors
Theoretical Computer Science
Remarks on Testing Probabilistic Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Notes on Generative Probabilistic Bisimulation
Electronic Notes in Theoretical Computer Science (ENTCS)
Symbolic model checking for probabilistic timed automata
Information and Computation
Proving Approximate Implementations for Probabilistic I/O Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Q-Automata: Modelling the Resource Usage of Concurrent Components
Electronic Notes in Theoretical Computer Science (ENTCS)
A testing scenario for probabilistic processes
Journal of the ACM (JACM)
Modular construction of complete coalgebraic logics
Theoretical Computer Science
Expressing Priorities and External Probabilities in Process Algebra via Mixed Open/Closed Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Analyzing Security Protocols Using Time-Bounded Task-PIOAs
Discrete Event Dynamic Systems
Modular Games for Coalgebraic Fixed Point Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
The power of simulation relations
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Model Checking HML on Piecewise-Constant Inhomogeneous Markov Chains
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Branching Bisimulation Congruence for Probabilistic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Non-determinism and Probabilities in Timed Concurrent Constraint Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Theoretical Computer Science
CoLoSS: The Coalgebraic Logic Satisfiability Solver
Electronic Notes in Theoretical Computer Science (ENTCS)
Bisimulation for Demonic Schedulers
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
Electronic Notes in Theoretical Computer Science (ENTCS)
Deriving Syntax and Axioms for Quantitative Regular Behaviours
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Weighted Bisimulation in Linear Algebraic Form
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
On the Expressive Power of Schedulers in Distributed Probabilistic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Memoryless Strategies for Stochastic Games via Domain Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Weak Bisimulation for Action-Type Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
PMaude: Rewrite-based Specification Language for Probabilistic Object Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Trace Machines for Observing Continuous-Time Markov Chains
Electronic Notes in Theoretical Computer Science (ENTCS)
Metrics for Action-labelled Quantitative Transition Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Partial Order Reduction for Probabilistic Branching Time
Electronic Notes in Theoretical Computer Science (ENTCS)
A theory of stochastic systems part I: Stochastic automata
Information and Computation
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
A testing scenario for probabilistic automata
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Discounting the future in systems theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Logical characterizations of bisimulations for discrete probabilistic systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Abstract interpretation of programs as Markov decision processes
SAS'03 Proceedings of the 10th international conference on Static analysis
Magnifying-lens abstraction for Markov decision processes
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Non-expansive ε-bisimulations for probabilistic processes
Theoretical Computer Science
Probabilistic anonymity via coalgebraic simulations
Theoretical Computer Science
Measuring anonymity with relative entropy
FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
Quantitative model checking revisited: neither decidable nor approximable
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
A probabilistic applied pi-calculus
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Model-checking ω-regular properties of interval Markov chains
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Compositional methods for information-hiding
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Making random choices invisible to the scheduler
Information and Computation
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Traces, executions and schedulers, coalgebraically
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
A game-based abstraction-refinement framework for Markov decision processes
Formal Methods in System Design
Weak bisimulation for Probabilistic Timed Automata
Theoretical Computer Science
Simulation and bisimulation for probabilistic timed automata
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Qualitative analysis of partially-observable Markov decision processes
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Concurrency and composition in a stochastic world
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Information flow in interactive systems
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Generic forward and backward simulations II: probabilistic simulation
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Conditional automata: a tool for safe removal of negligible events
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Probabilistic Logical Characterization
Information and Computation
Composing systems while preserving probabilities
EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
Reasoning about probabilistic security using task-PIOAs
ARSPA-WITS'10 Proceedings of the 2010 joint conference on Automated reasoning for security protocol analysis and issues in the theory of security
Time-bounded reachability in distributed input/output interactive probabilistic chains
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Characterising probabilistic processes logically
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Superposition-based analysis of first-order probabilistic timed automata
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
On model checking techniques for randomized distributed systems
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
The how and why of interactive Markov chains
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
Quantitative Kleene coalgebras
Information and Computation
Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
Mathematical Structures in Computer Science
Probabilistic modal µ-calculus with independent product
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Quantitative multi-objective verification for probabilistic systems
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Confluence reduction for probabilistic systems
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Automated learning of probabilistic assumptions for compositional reasoning
FASE'11/ETAPS'11 Proceedings of the 14th international conference on Fundamental approaches to software engineering: part of the joint European conferences on theory and practice of software
Partial order methods for statistical model checking and simulation
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
On the semantics of Markov automata
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Symbolic algorithms for qualitative analysis of Markov decision processes with Buchi objectives
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Bisimulations meet PCTL equivalences for probabilistic automata
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
A spectrum of behavioral relations over LTSs on probability distributions
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Semantic analysis of gossip protocols for wireless sensor networks
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Performance model checking scenario-aware dataflow
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Learning-based compositional verification for synchronous probabilistic systems
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
A linear process-algebraic format with data for probabilistic automata
Theoretical Computer Science
Branching bisimulation congruence for probabilistic systems
Theoretical Computer Science
Partial order reduction for markov decision processes: a survey
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
On reduction criteria for probabilistic reward models
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Specification and refinement of soft real-time requirements using sequence diagrams
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Towards automated proof support for probabilistic distributed systems
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Switched probabilistic i/o automata
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Journal of the ACM (JACM)
ICESS'05 Proceedings of the Second international conference on Embedded Software and Systems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Time-bounded task-PIOAs: a framework for analyzing security protocols
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Bisimulations for non-deterministic labelled markov processes
Mathematical Structures in Computer Science
Error control for probabilistic model checking
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Axiomatizations for probabilistic finite-state behaviors
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
Combining extended UML models and formal methods to analyze real-time systems
SAFECOMP'05 Proceedings of the 24th international conference on Computer Safety, Reliability, and Security
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Quantitative refinement and model checking for the analysis of probabilistic systems
FM'06 Proceedings of the 14th international conference on Formal Methods
Using probabilistic kleene algebra for protocol verification
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Probability and nondeterminism in operational models of concurrency
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Calculating probabilities of real-time test cases
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
Underspecification, inherent nondeterminism and probability in sequence diagrams
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Retaining the probabilities in probabilistic testing theory
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Assume-Guarantee verification for probabilistic systems
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Computing the leakage of information-hiding systems
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Model-Checking markov chains in the presence of uncertainties
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Model-checking and simulation for stochastic timed systems
FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
An algorithm for probabilistic alternating simulation
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
A general framework for probabilistic characterizing formulae
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
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
Probabilistic CSP: preserving the laws via restricted schedulers
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
Heuristics for probabilistic timed automata with abstraction refinement
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
Simulation and statistical model checking for modestly nondeterministic models
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
Revisiting trace and testing equivalences for nondeterministic and probabilistic processes
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Probabilistic transition system specification: congruence and full abstraction of bisimulation
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Making random choices invisible to the scheduler
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Modular algorithms for heterogeneous modal logics
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Efficient modelling and generation of Markov automata
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Compositionality of probabilistic Hennessy-Milner logic through structural operational semantics
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Weak bisimulations for coalgebras over ordered functors
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Compositional abstraction techniques for probabilistic automata
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Modelling and decentralised runtime control of self-stabilising power micro grids
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
On the semantics of Markov automata
Information and Computation
Information flow in systems with schedulers, Part I: Definitions
Theoretical Computer Science
Scale-Freeness of SPA models with weighted immediate actions
EPEW'12 Proceedings of the 9th European conference on Computer Performance Engineering
Scale-Freeness of SPA models with weighted immediate actions
EPEW'12 Proceedings of the 9th European conference on Computer Performance Engineering
A proof system for compositional verification of probabilistic concurrent processes
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
The quest for minimal quotients for probabilistic automata
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
An extension of the inverse method to probabilistic timed automata
Formal Methods in System Design
Rewarding probabilistic hybrid automata
Proceedings of the 16th international conference on Hybrid systems: computation and control
Automated reliability estimation over partial systematic explorations
Proceedings of the 2013 International Conference on Software Engineering
Model-based specification, analysis and synthesis of servo controllers for lithoscanners
Proceedings of the 6th International Workshop on Multi-Paradigm Modeling
A uniform definition of stochastic process calculi
ACM Computing Surveys (CSUR)
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Cost preserving bisimulations for probabilistic automata
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
High-Level counterexamples for probabilistic automata
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Modelling, reduction and analysis of markov automata
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Deciding bisimilarities on distributions
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Revisiting weak simulation for substochastic markov chains
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
From software verification to `everyware' verification
Computer Science - Research and Development
A compositional modelling and analysis framework for stochastic hybrid systems
Formal Methods in System Design
Quantitative information flow in interactive systems
Journal of Computer Security - ARSPA-WITS'10
| Hi-index | 0.01 |