On the public citation graph

Weak bisimulation for fully probabilistic processes

https://doi.org/10.1007/3-540-63166-6_14

0 signed · 182 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1993.1012openalex-snapshot

Probabilistic Verification

inferredcites →https://doi.org/10.1006/inco.1995.1123openalex-snapshot

Reactive, Generative, and Stratified Models of Probabilistic Processes

inferredcites →https://doi.org/10.1006/inco.1995.1135openalex-snapshot

Axiomatizing Probabilistic Processes: ACP with Generative Probabilities

inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot

A Calculus of Communicating Systems

inferredcites →https://doi.org/10.1007/3-540-55179-4_30openalex-snapshot

Efficient algorithms for verification of equivalences for probabilistic processes

inferredcites →https://doi.org/10.1007/3-540-55719-9_116openalex-snapshot

Testing preorders for probabilistic processes

inferredcites →https://doi.org/10.1007/3-540-60045-0_48openalex-snapshot

It usually works: The temporal logic of stochastic systems

inferredcites →https://doi.org/10.1007/3-540-61474-5_57openalex-snapshot

Polynomial time algorithms for testing probabilistic bisimulation and simulation

inferredcites →https://doi.org/10.1007/978-0-387-34945-9_27openalex-snapshot

Testing Semantics for Probabilistic LOTOS

inferredcites →https://doi.org/10.1007/978-0-387-35079-0_28openalex-snapshot

Specification and Verification of the PowerScaleTM Bus Arbitration Protocol: An Industrial Experiment with LOTOS

inferredcites →https://doi.org/10.1007/978-1-4684-9440-2openalex-snapshot

Measure Theory

inferredcites →https://doi.org/10.1007/978-3-540-48654-1_36openalex-snapshot

Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes

inferredcites →https://doi.org/10.1007/bf01211866openalex-snapshot

A logic for reasoning about time and reliability

inferredcites →https://doi.org/10.1007/bf01211910openalex-snapshot

Priority as extremal probability

inferredcites →https://doi.org/10.1007/bf01843570openalex-snapshot

Verification of multiprocess probabilistic protocols

inferredcites →https://doi.org/10.1007/bfb0015027openalex-snapshot

Probabilistic simulations for probabilistic processes

inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot

Concurrency and automata on infinite sequences

inferredcites →https://doi.org/10.1007/bfb0032063openalex-snapshot

An efficient algorithm for branching bisimulation and stuttering equivalence

inferredcites →https://doi.org/10.1007/bfb0039056openalex-snapshot

Testing equivalences and fully abstract models for probabilistic processes

inferredcites →https://doi.org/10.1007/bfb0039071openalex-snapshot

Equivalences, congruences, and complete axiomatizations for probabilistic processes

inferredcites →https://doi.org/10.1007/bfb0084809openalex-snapshot

Compositional verification of probabilistic processes

inferredcites →https://doi.org/10.1016/0167-6423(92)90005-vopenalex-snapshot

The Esterel synchronous programming language: design, semantics, implementation

inferredcites →https://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot

Calculi for synchrony and asynchrony

inferredcites →https://doi.org/10.1016/0304-3975(84)90113-0openalex-snapshot

Testing equivalences for processes

inferredcites →https://doi.org/10.1016/0304-3975(94)00286-0openalex-snapshot

Probabilistic communicating processes

inferredcites →https://doi.org/10.1016/0890-5401(90)90025-dopenalex-snapshot

CCS expressions, finite state processes, and three problems of equivalence

inferredcites →https://doi.org/10.1016/0890-5401(91)90030-6openalex-snapshot

Bisimulation through probabilistic testing

inferredcites →https://doi.org/10.1016/b978-0-444-89874-6.50010-6openalex-snapshot

Testing Probabilistic and Nondeterministic Processes

inferredcites →https://doi.org/10.1016/s0019-9958(84)80025-xopenalex-snapshot

Process algebra for synchronous communication

inferredcites →https://doi.org/10.1016/s0167-6423(96)00019-6openalex-snapshot

Probabilistic models for the guarded command language

inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot

Matrix multiplication via arithmetic progressions

inferredcites →https://doi.org/10.1016/s1571-0661(05)80222-1openalex-snapshot

A Fully Abstract Metric-Space Denotational Semantics for Reactive Probabilistic Processes

inferredcites →https://doi.org/10.1016/s1571-0661(05)82521-6openalex-snapshot

Mixing Up Nondeterminism and Probability: a preliminary report

inferredcites →https://doi.org/10.1038/142354a0openalex-snapshot

Time and Probability

inferredcites →https://doi.org/10.1109/32.159839openalex-snapshot

Programming and verifying real-time systems by means of the synchronous data-flow language LUSTRE

inferredcites →https://doi.org/10.1109/icdcs.1992.235032openalex-snapshot

Probabilistic characterization of algebraic protocol specifications

inferredcites →https://doi.org/10.1109/lics.1991.151651openalex-snapshot

Specification and refinement of probabilistic processes

inferredcites →https://doi.org/10.1109/lics.1995.523277openalex-snapshot

Compositional testing preorders for probabilistic processes

inferredcites →https://doi.org/10.1109/real.1990.128759openalex-snapshot

A calculus for communicating systems with time and probabilities

inferredcites →https://doi.org/10.1109/sfcs.1985.12openalex-snapshot

Automatic verification of probabilistic concurrent finite state programs

inferredcites →https://doi.org/10.1109/sfcs.1988.21950openalex-snapshot

Verifying temporal properties of finite-state probabilistic programs

inferredcites →https://doi.org/10.1137/0216062openalex-snapshot

Three Partition Refinement Algorithms

inferredcites →https://doi.org/10.1145/123041.123062openalex-snapshot

Programming and verifying critical systems by means of the synchronous data-flow language LUSTRE

inferredcites →https://doi.org/10.1145/186025.186051openalex-snapshot

Model checking and abstraction

inferredcites →https://doi.org/10.1145/210332.210339openalex-snapshot

The complexity of probabilistic verification

inferredcites →https://doi.org/10.1145/233551.233556openalex-snapshot

Branching time and abstraction in bisimulation semantics

inferredcites →https://doi.org/10.1145/28395.28396openalex-snapshot

Matrix multiplication via arithmetic progressions

inferredcites →https://doi.org/10.1145/800057.808660openalex-snapshot

Probabilistic temporal logics for finite and bounded models

inferredcites →https://doi.org/10.21236/ada461346openalex-snapshot

Model Checking of Probabilistic and Nondeterministic Systems

inferredcites →https://doi.org/10.3233/fi-1992-17304openalex-snapshot

On Some Equivalence Relations for Probabilistic Processes1

inferredcites →https://doi.org/10.5287/ora-rbq8vyqjnopenalex-snapshot

Probabilities and Priorities in Timed CSP

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4201825openalex-extracted

On Probabilistic Weak Bisimilarity

inferred← citeshttps://doi.org/10.2139/ssrn.4670463openalex-extracted

Analyzing Divergence for Nondeterministic Probabilistic Models

inferred← citeshttps://doi.org/10.1006/inco.1999.2808openalex-snapshot

Testing Preorders for Probabilistic Processes

inferred← citeshttps://doi.org/10.1006/jcss.1999.1683openalex-snapshot

Deciding Bisimilarity and Similarity for Probabilistic Processes

inferred← citeshttps://doi.org/10.1007/0-387-24098-5_2openalex-snapshot

Information Flow Analysis for Probabilistic Timed Automata

inferred← citeshttps://doi.org/10.1007/11560647_30openalex-snapshot

Weak Stochastic Bisimulation for Non-markovian Processes

inferred← citeshttps://doi.org/10.1007/11881070_118openalex-snapshot

Simulation for Interactive Markov Chains

inferred← citeshttps://doi.org/10.1007/3-540-44618-4_25openalex-snapshot

Weak Bisimulation for Probabilistic Systems

inferred← citeshttps://doi.org/10.1007/3-540-44667-2_6openalex-snapshot

Verification of Randomized Distributed Algorithms

inferred← citeshttps://doi.org/10.1007/3-540-44685-0_11openalex-snapshot

Probabilistic Information Flow in a Process Algebra

inferred← citeshttps://doi.org/10.1007/3-540-45319-9_15openalex-snapshot

Abstraction in Probabilistic Process Algebra

inferred← citeshttps://doi.org/10.1007/3-540-45605-8_3openalex-snapshot

Security Analysis of a Probabilistic Non-repudiation Protocol

inferred← citeshttps://doi.org/10.1007/3-540-45694-5_23openalex-snapshot

Simulation for Continuous-Time Markov Chains

inferred← citeshttps://doi.org/10.1007/3-540-45694-5_24openalex-snapshot

Weak Bisimulation is Sound and Complete for PCTL*

inferred← citeshttps://doi.org/10.1007/3-540-45694-5_25openalex-snapshot

Decision Algorithms for Probabilistic Bisimulation*

inferred← citeshttps://doi.org/10.1007/3-540-46432-8_1openalex-snapshot

Norm Functions for Probabilistic Bisimulations with Delays

inferred← citeshttps://doi.org/10.1007/3-540-48778-6_15openalex-snapshot

Bisimulation Algorithms for Stochastic Process Algebras and Their BDD-Based Implementation

inferred← citeshttps://doi.org/10.1007/3-540-48778-6_3openalex-snapshot

Establishing Qualitative Properties for Probabilistic Lossy Channel Systems

inferred← citeshttps://doi.org/10.1007/3-540-48778-6_8openalex-snapshot

An Axiomatization of Probabilistic Testing

inferred← citeshttps://doi.org/10.1007/3-540-69108-1_13openalex-snapshot

Iterative Decomposition and Aggregation of Labeled GSPNs

inferred← citeshttps://doi.org/10.1007/978-3-030-34175-6_20openalex-snapshot

Uniform Random Process Model Revisited

inferred← citeshttps://doi.org/10.1007/978-3-030-81688-9_27openalex-snapshot

Model Checking Finite-Horizon Markov Chains with Probabilistic Inference

inferred← citeshttps://doi.org/10.1007/978-3-031-20872-0_8openalex-snapshot

Embeddings Between State and Action Based Probabilistic Logics

inferred← citeshttps://doi.org/10.1007/978-3-031-57249-4_17openalex-snapshot

Forward and Backward Constrained Bisimulations for Quantum Circuits

inferred← citeshttps://doi.org/10.1007/978-3-031-62645-6_3openalex-snapshot

Noninterference Analysis of Reversible Probabilistic Systems

inferred← citeshttps://doi.org/10.1007/978-3-032-16855-9_5openalex-snapshot

Fixed-Point Reasoning for Stochastic Systems

inferred← citeshttps://doi.org/10.1007/978-3-319-17016-9_15openalex-snapshot

Introducing Probabilities in Controller Strategies

inferred← citeshttps://doi.org/10.1007/978-3-319-21690-4_13openalex-snapshot

PROPhESY: A PRObabilistic ParamEter SYnthesis Tool

inferred← citeshttps://doi.org/10.1007/978-3-319-67729-3_12openalex-snapshot

Trace Relations and Logical Preservation for Continuous-Time Markov Decision Processes

inferred← citeshttps://doi.org/10.1007/978-3-540-24611-4_3openalex-snapshot

An Overview of Probabilistic Process Algebras and Their Equivalences

inferred← citeshttps://doi.org/10.1007/978-3-540-24631-2_1openalex-snapshot

Two Formal Approaches for Approximating Noninterference Properties

inferred← citeshttps://doi.org/10.1007/978-3-540-30233-9_12openalex-snapshot

Branching Time Equivalences for Interactive Markov Chains

inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_4openalex-snapshot

Probabilistic Congruence for Semistochastic Generative Processes

inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_7openalex-snapshot

Axiomatizations for Probabilistic Finite-State Behaviors

inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_8openalex-snapshot

Stochastic Transition Systems for Continuous State Spaces and Non-determinism

inferred← citeshttps://doi.org/10.1007/978-3-540-40042-4_7openalex-snapshot

A Study about Trade-Off between Performance and Security in an Internet Audio Mechanism

inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_32openalex-snapshot

Comparative Branching-Time Semantics for Markov Chains

inferred← citeshttps://doi.org/10.1007/978-3-540-68982-9_10openalex-snapshot

Effective Minimization of Acyclic Phase-Type Representations

inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_14openalex-snapshot

Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations

inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_38openalex-snapshot

Magnifying-Lens Abstraction for Markov Decision Processes

inferred← citeshttps://doi.org/10.1007/978-3-540-79980-1_27openalex-snapshot

Non Expansive ε-Bisimulations

inferred← citeshttps://doi.org/10.1007/978-3-540-87891-9_9openalex-snapshot

State Space Reduction Techniques for Component Interfaces

inferred← citeshttps://doi.org/10.1007/978-3-642-02652-2_10openalex-snapshot

Probabilistic Reachability for Parametric Markov Models

inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_56openalex-snapshot

PARAM: A Model Checker for Parametric Markov Models

inferred← citeshttps://doi.org/10.1007/978-3-642-15375-4_3openalex-snapshot

Concurrency and Composition in a Stochastic World

inferred← citeshttps://doi.org/10.1007/978-3-642-20398-5_12openalex-snapshot

Synthesis for PCTL in Parametric Markov Decision Processes

inferred← citeshttps://doi.org/10.1007/978-3-642-30065-3_6openalex-snapshot

Weak Markovian Bisimulation Congruences and Exact CTMC-Level Aggregations for Sequential Processes

inferred← citeshttps://doi.org/10.1007/978-3-642-33475-7_7openalex-snapshot

Weak Bisimulations for Coalgebras over Ordered Functors

inferred← citeshttps://doi.org/10.1007/978-3-642-35722-0_11openalex-snapshot

Stuttering for Abstract Probabilistic Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-36742-7_2openalex-snapshot

The Quest for Minimal Quotients for Probabilistic Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-40206-7_18openalex-snapshot

Noninterfering Schedulers

inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_17openalex-snapshot

Coalgebraic Weak Bisimulation from Recursive Equations over Monads

inferred← citeshttps://doi.org/10.1007/978-3-662-44124-4_5openalex-snapshot

On Coalgebras with Internal Moves

inferred← citeshttps://doi.org/10.1007/978-3-662-45489-3openalex-snapshot

Stochastic Model Checking. Rigorous Dependability Analysis Using Model Checking Techniques for Stochastic Systems

inferred← citeshttps://doi.org/10.1007/978-3-662-45489-3_5openalex-snapshot

Computing Behavioral Relations for Probabilistic Concurrent Systems

inferred← citeshttps://doi.org/10.1007/978-94-010-0654-5_10openalex-snapshot

Domains of View: A Foundation for Specification and Analysis

inferred← citeshttps://doi.org/10.1007/s004460050046openalex-snapshot

Model checking for a probabilistic branching time logic with fairness

inferred← citeshttps://doi.org/10.1007/s10009-010-0146-xopenalex-snapshot

Probabilistic reachability for parametric Markov models

inferred← citeshttps://doi.org/10.1007/s10207-007-0050-xopenalex-snapshot

Estimating the maximum information leakage

inferred← citeshttps://doi.org/10.1007/s10515-022-00327-zopenalex-snapshot

A three-valued model abstraction framework for PCTL* stochastic model checking

inferred← citeshttps://doi.org/10.1007/s10703-020-00347-zopenalex-snapshot

Multi-scale verification of distributed synchronisation

inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50029-1openalex-snapshot

Probabilistic Extensions of Process Algebras**This chapter is dedicated to the fond memory of Linda Christoff.

inferred← citeshttps://doi.org/10.1016/j.entcs.2004.01.019openalex-snapshot

On Quantitative Analysis of Probabilistic Protocols

inferred← citeshttps://doi.org/10.1016/j.entcs.2004.02.007openalex-snapshot

A Quantitative Approach to Noninterference for Probabilistic Systems

inferred← citeshttps://doi.org/10.1016/j.entcs.2004.06.050openalex-snapshot

Weak Bisimulation for Action-Type Coalgebras

inferred← citeshttps://doi.org/10.1016/j.entcs.2004.11.028openalex-snapshot

Equivalences for Silent Transitions in Probabilistic Systems

inferred← citeshttps://doi.org/10.1016/j.entcs.2005.10.033openalex-snapshot

Metrics for Action-labelled Quantitative Transition Systems

inferred← citeshttps://doi.org/10.1016/j.entcs.2005.10.038openalex-snapshot

A Classification of Time and/or Probability Dependent Security Properties

inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.078openalex-snapshot

Bisimulation and Simulation Relations for Markov Chains

inferred← citeshttps://doi.org/10.1016/j.entcs.2006.07.019openalex-snapshot

Trace Semantics for Stochastic Systems with Nondeterminism

inferred← citeshttps://doi.org/10.1016/j.entcs.2006.09.016openalex-snapshot

Notes on Generative Probabilistic Bisimulation

inferred← citeshttps://doi.org/10.1016/j.entcs.2008.11.023openalex-snapshot

Branching Bisimulation Congruence for Probabilistic Systems

inferred← citeshttps://doi.org/10.1016/j.entcs.2013.12.002openalex-snapshot

Approximation Metrics Based on Probabilistic Bisimulations for General State-Space Markov Processes: A Survey

inferred← citeshttps://doi.org/10.1016/j.ic.2005.03.001openalex-snapshot

Comparative branching-time semantics for Markov chains

inferred← citeshttps://doi.org/10.1016/j.ic.2009.11.002openalex-snapshot

Weak bisimulation is sound and complete for pCTL∗

inferred← citeshttps://doi.org/10.1016/j.ic.2013.02.004openalex-snapshot

A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences

inferred← citeshttps://doi.org/10.1016/j.ic.2015.07.004openalex-snapshot

Polynomial time decision algorithms for probabilistic automata

inferred← citeshttps://doi.org/10.1016/j.ic.2018.08.003openalex-snapshot

The quest for minimal quotients for probabilistic and Markov automata

inferred← citeshttps://doi.org/10.1016/j.ipl.2003.10.001openalex-snapshot

Probabilistic weak simulation is decidable in polynomial time

inferred← citeshttps://doi.org/10.1016/j.ipl.2020.105947openalex-snapshot

Raiders of the lost equivalence: Probabilistic branching bisimilarity

inferred← citeshttps://doi.org/10.1016/j.ipl.2023.106399openalex-snapshot

Probabilistic weak bisimulation and axiomatization for probabilistic models

inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.09.002openalex-snapshot

Behavioural equivalences for coalgebras with unobservable moves

inferred← citeshttps://doi.org/10.1016/j.jlap.2013.05.006openalex-snapshot

Stuttering for Abstract Probabilistic Automata

inferred← citeshttps://doi.org/10.1016/j.tcs.2005.03.002openalex-snapshot

Measuring the confinement of probabilistic systems

inferred← citeshttps://doi.org/10.1016/j.tcs.2006.02.010openalex-snapshot

Branching bisimulation for probabilistic systems: Characteristics and decidability

inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.008openalex-snapshot

Axiomatizations for probabilistic finite-state behaviors

inferred← citeshttps://doi.org/10.1016/j.tcs.2010.01.027openalex-snapshot

Non-expansive ϵ -bisimulations for probabilistic processes

inferred← citeshttps://doi.org/10.1016/j.tcs.2010.09.003openalex-snapshot

Weak bisimulation for Probabilistic Timed Automata

inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.059openalex-snapshot

Lumpability abstractions of rule-based systems

inferred← citeshttps://doi.org/10.1016/j.tcs.2014.10.025openalex-snapshot

On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.07.043openalex-snapshot

Theory of interaction

inferred← citeshttps://doi.org/10.1016/j.tcs.2020.12.045openalex-snapshot

A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces

inferred← citeshttps://doi.org/10.1016/j.tcs.2021.04.001openalex-snapshot

Model independent approach to probabilistic models

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00305-4openalex-snapshot

Process algebra for performance evaluation

inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00294-8openalex-snapshot

Additive models of probabilistic processes

inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00344-9openalex-snapshot

Discrete time generative–reactive probabilistic processes with different advancing speeds

inferred← citeshttps://doi.org/10.1017/cbo9780511792588.008openalex-snapshot

Probabilistic bisimulation

inferred← citeshttps://doi.org/10.1017/s0960129512000254openalex-snapshot

Model checking for performability

inferred← citeshttps://doi.org/10.1109/csfw.2003.1212701openalex-snapshot

Probabilistic noninterference through weak probabilistic bisimulation

inferred← citeshttps://doi.org/10.1109/fcst.2009.37openalex-snapshot

A Local Algorithm for Checking Probabilistic Bisimilarity

inferred← citeshttps://doi.org/10.1109/imsccs.2007.42openalex-snapshot

Octree-Path-Chain Data Structure in a Knowledge-Based ICAS forNose-Nasal Surgery in Otolaryngology

inferred← citeshttps://doi.org/10.1109/imsccs.2007.57openalex-snapshot

Extending intransitive noninterference with probabilities in information flow security

inferred← citeshttps://doi.org/10.1109/qest.2005.9openalex-snapshot

Comparative analysis of bisimulation relations on alternating and non-alternating probabilistic models

inferred← citeshttps://doi.org/10.1109/qest.2011.32openalex-snapshot

Controlling Modelling Artifacts

inferred← citeshttps://doi.org/10.1109/sefm.2003.1236205openalex-snapshot

Weak bisimulation for probabilistic timed automata and applications to security

inferred← citeshttps://doi.org/10.1109/tse.2010.4openalex-snapshot

Time and Probability-Based Information Flow Analysis

inferred← citeshttps://doi.org/10.1109/tse.2010.88openalex-snapshot

Guest Editors' Introduction: 2008 Conference on the Foundations of Software Engineering

inferred← citeshttps://doi.org/10.1109/tse.2016.2527000openalex-snapshot

Probabilistic Interface Automata

inferred← citeshttps://doi.org/10.1109/tse.2025.3567423openalex-snapshot

Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification

inferred← citeshttps://doi.org/10.1145/1328438.1328478openalex-snapshot

Cryptographically sound implementations for typed information-flow security

inferred← citeshttps://doi.org/10.1145/1462179.1462181openalex-snapshot

Probabilistic bisimulation as a congruence

inferred← citeshttps://doi.org/10.1145/2400676.2400680openalex-snapshot

Bisimulation for Quantum Processes

inferred← citeshttps://doi.org/10.1145/3691620.3695499openalex-snapshot

Compositional Security Analysis of Dynamic Component-based Systems

inferred← citeshttps://doi.org/10.1145/3696431openalex-snapshot

Embeddings Between State and Action Based Probabilistic Logics

inferred← citeshttps://doi.org/10.1145/3712711openalex-snapshot

Forward and Backward Constrained Bisimulations for Quantum Circuits Using Decision Diagrams

inferred← citeshttps://doi.org/10.14569/ijacsa.2017.081026openalex-snapshot

Verifying Weak Probabilistic Noninterference

inferred← citeshttps://doi.org/10.2168/lmcs-11(2:14)2015openalex-snapshot

Weak bisimulation for coalgebras over order enriched monads

inferred← citeshttps://doi.org/10.2168/lmcs-4(4:6)2008openalex-snapshot

Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations

inferred← citeshttps://doi.org/10.22028/d291-25945openalex-snapshot

Decision algorithms for probabilistic simulations

inferred← citeshttps://doi.org/10.23638/lmcs-14(4:13)2018openalex-snapshot

Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata

inferred← citeshttps://doi.org/10.25596/jalc-2003-187openalex-snapshot

Weak Bisimulation for (max/+) Automata and Related Models

inferred← citeshttps://doi.org/10.3233/jcs-2004-12202openalex-snapshot

A process-algebraic approach for the analysis of probabilistic noninterference

inferred← citeshttps://doi.org/10.3233/jcs-2006-14605openalex-snapshot

Improved typings for probabilistic noninterference in a multi-threaded language

inferred← citeshttps://doi.org/10.3990/1.9789036505925openalex-snapshot

Efficient modelling, generation and analysis of Markov Automata

inferred← citeshttps://doi.org/10.4204/eptcs.40.10openalex-snapshot

Lumpability Abstractions of Rule-based Systems

inferred← citeshttps://doi.org/10.4304/jsw.4.1.90-97openalex-snapshot

Analysis for Real-time Intransitive Information Flow Security Properties

inferred← citeshttps://doi.org/10.46298/lmcs-17(4:24)2021openalex-snapshot

A coalgebraic take on regular and $\omega$-regular behaviours

inferred← citeshttps://doi.org/10.48550/arxiv.1310.4106openalex-snapshot

Weak bisimulations for labelled transition systems weighted over semirings

inferred← citeshttps://doi.org/10.48550/arxiv.1404.5267openalex-snapshot

Lax functors and coalgebraic weak bisimulation

inferred← citeshttps://doi.org/10.48550/arxiv.1508.00093openalex-snapshot

The Name-Passing Calculus

inferred← citeshttps://doi.org/10.70675/27880e7bz54b5z4d41z8efbz8e9e61ba28fbopenalex-snapshot

Formalisation de preuves de sécurité concrète

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.