The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Journal of the ACM (JACM)
Strategic directions in concurrency research
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Stochastic processes as concurrent constraint programs
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Let's evaluate performance algebraically
ACM Computing Surveys (CSUR)
Process algebra for performance evaluation
Theoretical Computer Science
Verification of randomized distributed algorithms
Lectures on formal methods and performance analysis
General distributions in process algebra
Lectures on formal methods and performance analysis
The theory of interactive generalized semi-Markov processes
Theoretical Computer Science
Testing preorders for probabilistic processes can be characterized by simulations
Theoretical Computer Science
Automatic verification of real-time systems with discrete probability distributions
Theoretical Computer Science
Additive models of probabilistic processes
Theoretical Computer Science
Imperative objects as mobile processes
Science of Computer Programming
Performance measure sensitive congruences for Markovian process algebras
Theoretical Computer Science
Discrete time generative-reactive probabilistic processes with different advancing speeds
Theoretical Computer Science
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Secure Information Flow as Typed Process Behaviour
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Quantifying the Dynamic Behavior of Process Algebras
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
Possibilistic and Probabilistic Abstraction-Based Model Checking
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Model Minimization in Hierarchical Reinforcement Learning
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Equational Axioms for Probabilistic Bisimilarity
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Refusal Simulation and Interactive Games
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Verifying Probabilistic Programs Using a Hoare like Logic
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Towards Quantitative Verification of Probabilistic Transition Systems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Testing Labelled Markov Processes
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Metrics for Labeled Markov 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
Nondeterminism and Probabilistic Choice: Obeying the Laws
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Performance Evaluation: = (Process Algebra + Model Checking) × Markov Chains
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
A Testing Theory for Generally Distributed Stochastic Processes
CONCUR '01 Proceedings of the 12th 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
Simulation for Continuous-Time Markov Chains
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Weak Bisimulation is Sound and Complete for PCTL*
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
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
The Demonic Product of Probabilistic Relations
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Stochastic Process Algebra: From an Algebraic Formalism to an Architectural Description Language
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
Towards Model Checking Stochastic Process Algebra
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
Bisimulation Algorithms for Stochastic Process Algebras and Their BDD-Based Implementation
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
An Axiomatization of Probabilistic Testing
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Fully Abstract Characterization of Probabilistic May Testing
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Specifying Performance Measures for PEPA
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Exploiting Modal Logic to Express Performance Measures
TOOLS '00 Proceedings of the 11th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
Logical Relations for Monadic Types
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
The max-plus algebra of the natural numbers has no finite equational basis
Theoretical Computer Science
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Approximating Labeled Markov Processes
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
The power of reachability testing for timed automata
Theoretical Computer Science
Probabilistic Dynamic Epistemic Logic
Journal of Logic, Language and Information
A New Type System for Secure Information Flow
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Equivalence notions and model minimization in Markov decision processes
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Approximating labelled Markov processes
Information and Computation
Weak bisimulation for (max/+) automata and related models
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)
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)
PEPA nets: a structured performance modelling formalism
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
Optimal state-space lumping in Markov chains
Information Processing Letters
Precongruence formats for decorated trace semantics
ACM Transactions on Computational Logic (TOCL)
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Theoretical Computer Science
Domain equations for probabilistic processes
Mathematical Structures in Computer Science
Semi-pullbacks and bisimulation in categories of Markov processes
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Software performance modelling using PEPA nets
WOSP '04 Proceedings of the 4th international workshop on Software and performance
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
Metrics for finite Markov decision processes
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
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
Model checking meets performance evaluation
ACM SIGMETRICS Performance Evaluation Review
ProbMela and verification of Markov decision processes
ACM SIGMETRICS Performance Evaluation Review
A behavioural pseudometric for probabilistic transition systems
Theoretical Computer Science - Automata, languages and programming
Comparative branching-time semantics for Markov chains
Information and Computation
A theory of stochastic systems: part I: Stochastic automata
Information and Computation
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
Theoretical Computer Science
Specification, testing and implementation relations for symbolic-probabilistic systems
Theoretical Computer Science
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
Bisimulation and cocongruence for probabilistic systems
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Bisimulation relations for dynamical, control, and hybrid systems
Theoretical Computer Science
Probabilistic temporal logics via the modal mu-calculus
Theoretical Computer Science
Splitting bisimulations and retrospective conditions
Information and Computation
Probabilistic event structures and domains
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Approximating and computing behavioural distances in probabilistic transition systems
Theoretical Computer Science
Measuring the confinement of probabilistic systems
Theoretical Computer Science - Theoretical foundations of security analysis and design II
Weakening the perfect encryption assumption in Dolev-Yao adversaries
Theoretical Computer Science - Theoretical foundations of security analysis and design II
Domain theory, testing and simulation for labelled Markov processes
Theoretical Computer Science - Foundations of software science and computation structures
Switched PIOA: parallel composition via distributed scheduling
Theoretical Computer Science - Components and objects
Conjunction on processes: Full abstraction via ready-tree semantics
Theoretical Computer Science
Remarks on Testing Probabilistic Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Labelled Markov Processes as Generalised Stochastic Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
Stochastic Petri Box Calculus with Discrete Time
Fundamenta Informaticae
Improved typings for probabilistic noninterference in a multi-threaded language
Journal of Computer Security
Notes on Generative Probabilistic Bisimulation
Electronic Notes in Theoretical Computer Science (ENTCS)
Recursively defined metric spaces without contraction
Theoretical Computer Science
Fast probabilistic simulation, nontermination, and secure information flow
Proceedings of the 2007 workshop on Programming languages and analysis for security
Proving Approximate Implementations for Probabilistic I/O Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic bisimulations for quantum processes
Information and Computation
Simulations Up-to and Canonical Preorders
Electronic Notes in Theoretical Computer Science (ENTCS)
A testing scenario for probabilistic processes
Journal of the ACM (JACM)
The reactive simulatability (RSIM) framework for asynchronous systems
Information and Computation
Modular construction of complete coalgebraic logics
Theoretical Computer Science
Expressivity of coalgebraic modal logic: The limits and beyond
Theoretical Computer Science
A congruence relation for sPBC
Formal Methods in System Design
Bisimulation relations for weighted automata
Theoretical Computer Science
Mathematical Structures in Computer Science
Domain semantics of possibility computations
Information Sciences: an International Journal
An Exercise on Transition Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Controller Synthesis for Finite-State Markov Decision Processes
Fundamenta Informaticae
A Relation-Algebraic Theory of Bisimulations
Fundamenta Informaticae
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
Multiset Bisimulations as a Common Framework for Ordinary and Probabilistic Bisimulations
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
From Gene Regulation to Stochastic Fusion
UC '08 Proceedings of the 7th international conference on Unconventional Computing
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
Probabilistic bisimulation as a congruence
ACM Transactions on Computational Logic (TOCL)
PSPACE bounds for rank-1 modal logics
ACM Transactions on Computational Logic (TOCL)
Quantifying Timing Leaks and Cost Optimisation
ICICS '08 Proceedings of the 10th International Conference on Information and Communications Security
Theoretical Computer Science
On metrics for probabilistic systems: Definitions and algorithms
Computers & Mathematics with Applications
(Bi)simulations up-to characterise process semantics
Information and Computation
CoLoSS: The Coalgebraic Logic Satisfiability Solver
Electronic Notes in Theoretical Computer Science (ENTCS)
Logical relations for monadic types†
Mathematical Structures in Computer Science
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
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
A perspective on service orchestration
Science of Computer Programming
Behavioral and Logical Equivalence of Stochastic Kripke Models in General Measurable Spaces
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Approximating Markov Processes by Averaging
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Metrics for finite Markov decision processes
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
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
A Demonic Approach to Information in Probabilistic Systems
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
A Formal Framework for User Centric Control of Probabilistic Multi-agent Cyber-Physical Systems
Computational Logic in Multi-Agent Systems
Learning the Difference between Partially Observable Dynamical Systems
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II
Mutation testing from probabilistic and stochastic finite state machines
Journal of Systems and Software
Electronic Notes in Theoretical Computer Science (ENTCS)
The Kantorovich Metric in Computer Science: A Brief Survey
Electronic Notes in Theoretical Computer Science (ENTCS)
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Equivalence relations in fully and partially observable Markov decision processes
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A Statistical Approach to Test Stochastic and Probabilistic Systems
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
From Bialgebraic Semantics to Congruence Formats
Electronic Notes in Theoretical Computer Science (ENTCS)
On Logics for Coalgebraic Simulation
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Weak Bisimulation for Action-Type Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Filling Out the Gaps: A Padding Algorithm for Transforming Out Timing Leaks
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
Comparative branching-time semantics for Markov chains
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
Bisimulation and cocongruence for probabilistic systems
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Model Checking for a Class of Weighted Automata
Discrete Event Dynamic Systems
Theoretical Computer Science
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
An intrinsic characterization of approximate probabilistic bisimilarity
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Testing a probabilistic FSM using interval estimation
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the axiomatizability of ready traces, ready simulation, and failure traces
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A testing scenario for probabilistic automata
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Approximating a behavioural pseudometric without discount for probabilistic systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Logical characterizations of bisimulations for discrete probabilistic systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Rank-1 modal logics are coalgebraic
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Bisimulation minimisation mostly speeds up probabilistic model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Coalgebraic modal logic in COCASL
WADT'06 Proceedings of the 18th international conference on Recent trends in algebraic development techniques
A survey of Markovian behavioral equivalences
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Non-expansive ε-bisimulations for probabilistic processes
Theoretical Computer Science
Deciding simulations on probabilistic automata
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Three-valued abstractions of Markov chains: completeness for a sizeable fragment of PCTL
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Beyond rank 1: algebraic semantics and finite models for coalgebraic logics
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Structural operational semantics for stochastic process calculi
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Design in CommUnity with extension morphisms
Formal methods and hybrid real-time systems
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
Structural operational semantics for weighted transition systems
Semantics and algebraic specification
Performance evaluation and model checking join forces
Communications of the ACM
Approximating labelled Markov processes again!
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Non-strongly stable orders also define interesting simulation relations
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
A game-based abstraction-refinement framework for Markov decision processes
Formal Methods in System Design
Weak bisimulation for Probabilistic Timed Automata
Theoretical Computer Science
Annotated probabilistic temporal logic
ACM Transactions on Computational Logic (TOCL)
Concurrency and composition in a stochastic world
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
Flat coalgebraic fixed point logics
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Uniform labeled transition systems for nondeterministic, probabilistic, and stochastic processes
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Probabilistic Logical Characterization
Information and Computation
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
Characterising probabilistic processes logically
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Towards probabilistic modelling in event-B
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Statistical model checking: an overview
RV'10 Proceedings of the First international conference on Runtime verification
Information Processing Letters
A logical duality for underspecified probabilistic systems
Information and Computation
Quantitative Kleene coalgebras
Information and Computation
Coalgebraic logic over general measurable spaces ??? a survey
Mathematical Structures in Computer Science
Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
Mathematical Structures in Computer Science
Unprovability of the logical characterization of bisimulation
Information and Computation
Similarity quotients as final coalgebras
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
Linear-time and may-testing in a probabilistic reactive setting
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
Probabilistic bisimulation and simulation algorithms by abstract interpretation
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Axiomatizing weak ready simulation semantics over BCCSP
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Equivalences for a biological process algebra
Theoretical Computer Science
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
On quantitative security policies
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
A linear process-algebraic format with data for probabilistic automata
Theoretical Computer Science
Branching bisimulation congruence for probabilistic systems
Theoretical Computer Science
Two-thirds simulation indexes and modal logic characterization
Frontiers of Computer Science in China
Partial order reduction for markov decision processes: a survey
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Simulation for interactive markov chains
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part I
Testing probabilistic equivalence through reinforcement learning
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
On reduction criteria for probabilistic reward models
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
A finite model construction for coalgebraic modal logic
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Embedding real time in stochastic process algebras
EPEW'06 Proceedings of the Third European conference on Formal Methods and Stochastic Models for Performance Evaluation
2/3 alternating simulation between interface automata
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Symbolic generalization for on-line planning
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
A logic for reasoning about evidence
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
An accessible approach to behavioural pseudometrics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On the expressiveness of refinement settings
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
A coalgebraic perspective on linear weighted automata
Information and Computation
Symmetry reduction for probabilistic model checking
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Bisimulations for non-deterministic labelled markov processes
Mathematical Structures in Computer Science
Non-termination and secure information flow
Mathematical Structures in Computer Science - Programming Language Interference and Dependence
Testing of symbolic-probabilistic systems
FATES'04 Proceedings of the 4th international conference on Formal Approaches to Software Testing
Bisimulation for general stochastic hybrid systems
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Bisimulation for communicating piecewise deterministic markov processes (CPDPs)
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Branching cells as local states for event structures and nets: probabilistic applications
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
Expressivity of coalgebraic modal logic: the limits and beyond
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Final sequences and final coalgebras for measurable spaces
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Scaling probabilistic timing verification of hardware using abstractions in design source code
Proceedings of the International Conference on Formal Methods in Computer-Aided Design
Linking theories of concurrency
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
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
Probabilistic i/o automata: theories of two equivalences
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Symmetry reduction for probabilistic model checking using generic representatives
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Compositional reasoning for probabilistic finite-state behaviors
Processes, Terms and Cycles
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
Hyperfinite approximations to labeled markov transition systems
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Coalgebraic correspondence theory
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Global caching for coalgebraic description logics
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Linking theories of concurrency
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
Value-passing CCS with noisy channels
Theoretical Computer Science
Measurable stochastics for Brane Calculus
Theoretical Computer Science
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
The equational theory of weak complete simulation semantics over BCCSP
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
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
Narcissists are easy, stepmothers are hard
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
On the complexity of computing probabilistic bisimilarity
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
Belief bisimulation for hidden markov models: logical characterisation and decision algorithm
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Formal Methods in System Design
On behavioural pseudometrics and closure ordinals
Information Processing Letters
Bisimulation Metrics for Continuous Markov Decision Processes
SIAM Journal on Computing
p-Automata: New foundations for discrete-time probabilistic verification
Performance Evaluation
New results for Constraint Markov Chains
Performance Evaluation
Computing game metrics on markov decision processes
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
On the Controller Synthesis for Finite-State Markov Decision Processes
Fundamenta Informaticae
A Relation-Algebraic Theory of Bisimulations
Fundamenta Informaticae
Stochastic Petri Box Calculus with Discrete Time
Fundamenta Informaticae
Taking it to the limit: approximate reasoning for markov processes
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
A pseudometric in supervisory control of probabilistic discrete event systems
Discrete Event Dynamic Systems
Bisimulation and logical preservation for continuous-time markov decision processes
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
Continuous capacities on continuous state spaces
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Typed linear algebra for weigthed (probabilistic) automata
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Compositionality of probabilistic Hennessy-Milner logic through structural operational semantics
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
A probabilistic hybrid logic for sanitized information systems
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Confidence bounds for statistical model checking of probabilistic hybrid systems
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
On-the-Fly exact computation of bisimilarity distances
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Structural operational semantics for stochastic and weighted transition systems
Information and Computation
Testing probabilistic equivalence through Reinforcement Learning
Information and Computation
Coalgebraic announcement logics
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Concurrency meets probability: theory and practice
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
The bisimdist library: efficient computation of bisimilarity distances for markovian models
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
On coinductive equivalences for higher-order probabilistic functional programs
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Approximating Markov Processes by Averaging
Journal of the ACM (JACM)
General patterns of interaction in stochastic fusion
Natural Computing: an international journal
Electronic Notes in Theoretical Computer Science (ENTCS)
Model checking for probabilistic timed automata
Formal Methods in System Design
Stone Duality for Markov Processes
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
The Logic of Exact Covers: Completeness and Uniform Interpolation
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.04 |