On the public citation graph

Compositional verification of probabilistic processes

https://doi.org/10.1007/bfb0084809
0 signed · 109 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.1007/3-540-51237-3_4openalex-snapshot
A remark on bisimulation between probabilistic processes
inferredcites →https://doi.org/10.1007/3-540-54233-7_135openalex-snapshot
The expressive power of implicit specifications
inferredcites →https://doi.org/10.1007/3-540-55179-4_4openalex-snapshot
Compositional checking of satisfaction
inferredcites →https://doi.org/10.1007/3-540-55719-9_116openalex-snapshot
Testing preorders for probabilistic processes
inferredcites →https://doi.org/10.1007/978-3-642-82921-5_4openalex-snapshot
Notes on Communicating Sequential Systems
inferredcites →https://doi.org/10.1007/bf00709155openalex-snapshot
Compositional checking of satisfaction
inferredcites →https://doi.org/10.1007/bf01843570openalex-snapshot
Verification of multiprocess probabilistic protocols
inferredcites →https://doi.org/10.1007/bfb0015727openalex-snapshot
Linear and branching structures in the semantics and logics of reactive systems
inferredcites →https://doi.org/10.1007/bfb0039050openalex-snapshot
Ideal specification formalism = expressivity + compositionality + decidability + testability + ...
inferredcites →https://doi.org/10.1016/0022-0000(81)90036-2openalex-snapshot
Semantics of probabilistic programs
inferredcites →https://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
inferredcites →https://doi.org/10.1016/0890-5401(90)90060-uopenalex-snapshot
A logic for reasoning about probabilities
inferredcites →https://doi.org/10.1016/0890-5401(91)90030-6openalex-snapshot
Bisimulation through probabilistic testing
inferredcites →https://doi.org/10.1016/s0019-9958(84)80025-xopenalex-snapshot
Process algebra for synchronous communication
inferredcites →https://doi.org/10.1093/logcom/1.6.761openalex-snapshot
Compositionality Through an Operational Semantics of Contexts
inferredcites →https://doi.org/10.1109/lics.1988.5138openalex-snapshot
A logic for reasoning about probabilities
inferredcites →https://doi.org/10.1109/lics.1989.39173openalex-snapshot
A probabilistic powerdomain of evaluations
inferredcites →https://doi.org/10.1109/lics.1990.113740openalex-snapshot
Reactive, generative, and stratified models of probabilistic processes
inferredcites →https://doi.org/10.1109/lics.1991.151651openalex-snapshot
Specification and refinement of 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.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
inferredcites →https://doi.org/10.1145/75277.75307openalex-snapshot
Bisimulation through probabilistic testing (preliminary report)
inferredcites →https://doi.org/10.1145/800061.808758openalex-snapshot
A probabilistic PDL

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.1995.1135openalex-snapshot
Axiomatizing Probabilistic Processes: ACP with Generative Probabilities
inferred← citeshttps://doi.org/10.1006/inco.2000.3058openalex-snapshot
Language-based Performance Prediction for Distributed and Mobile Systems
inferred← citeshttps://doi.org/10.1006/jcss.1999.1683openalex-snapshot
Deciding Bisimilarity and Similarity for Probabilistic Processes
inferred← citeshttps://doi.org/10.1007/11601548_17openalex-snapshot
Compositional Reasoning for Probabilistic Finite-State Behaviors
inferred← citeshttps://doi.org/10.1007/11817949_23openalex-snapshot
Probabilistic I/O Automata: Theories of Two Equivalences
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-44804-7_11openalex-snapshot
Expressing Processes with Different Action Durations through Probabilities
inferred← citeshttps://doi.org/10.1007/3-540-45719-4_17openalex-snapshot
Equational Axioms for Probabilistic Bisimilarity
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_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-49213-5_1openalex-snapshot
The Need for Compositional Proof Systems: A Survey
inferred← citeshttps://doi.org/10.1007/3-540-49213-5_20openalex-snapshot
Compositional Verification of Randomized Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-49727-7_10openalex-snapshot
Constructing Specific SOS Semantics for Concurrency via Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_190openalex-snapshot
Algebraic reasoning for real-time probabilistic processes with uncertain information
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_103openalex-snapshot
Automatic synthesis of real time systems
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_17openalex-snapshot
A compositional trace-based semantics for probabilistic automata
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_18openalex-snapshot
Acceptance trees for probabilistic processes
inferred← citeshttps://doi.org/10.1007/3-540-61550-4_167openalex-snapshot
Probabilistic metric semantics for a simple language with recursion
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_199openalex-snapshot
Symbolic model checking for probabilistic processes
inferred← citeshttps://doi.org/10.1007/3-540-63166-6_14openalex-snapshot
Weak bisimulation for fully probabilistic processes
inferred← citeshttps://doi.org/10.1007/978-0-387-34945-9_27openalex-snapshot
Testing Semantics for Probabilistic LOTOS
inferred← citeshttps://doi.org/10.1007/978-1-4471-2061-2_4openalex-snapshot
Composition and Refinement of Probabilistic Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-05119-2_18openalex-snapshot
Group-by-Group Probabilistic Bisimilarities and Their Logical Characterizations
inferred← citeshttps://doi.org/10.1007/978-3-319-46206-6_22openalex-snapshot
Topological Constructions of Epsilon-Bisimulation
inferred← citeshttps://doi.org/10.1007/978-3-322-90137-8_18openalex-snapshot
Vertrauen als integraler Bestandteil kryptografischer Spezifikationen
inferred← citeshttps://doi.org/10.1007/978-3-540-24611-4_1openalex-snapshot
Probabilistic Automata: System Types, Parallel Composition and Comparison
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_32openalex-snapshot
A congruence theorem for structured operational semantics with predicates and negative premises
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_36openalex-snapshot
Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-78800-3_13openalex-snapshot
On Automated Verification of Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_18openalex-snapshot
Towards Performance Prediction of Compositional Models in Industrial GALS Designs
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_11openalex-snapshot
Deriving Syntax and Axioms for Quantitative Regular Behaviours
inferred← citeshttps://doi.org/10.1007/978-3-642-11486-1_3openalex-snapshot
Compositional and Quantitative Model Checking (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-34281-3_12openalex-snapshot
Modeling and Verification of Probabilistic Actor Systems Using pRebeca
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-662-04293-9_9openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.1007/978-3-662-45198-4_3openalex-snapshot
Probabilistic Bisimulation
inferred← citeshttps://doi.org/10.1007/bfb0084810openalex-snapshot
Axiomatizing probabilistic processes: ACP with generative probabilities
inferred← citeshttps://doi.org/10.1007/s00236-014-0210-1openalex-snapshot
Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes
inferred← citeshttps://doi.org/10.1007/s004460050046openalex-snapshot
Model checking for a probabilistic branching time logic with fairness
inferred← citeshttps://doi.org/10.1007/s11390-013-1400-yopenalex-snapshot
The Infinite Evolution Mechanism of ϵ-Bisimilarity
inferred← citeshttps://doi.org/10.1007/s11859-016-1137-xopenalex-snapshot
Probabilistic model of software approximate correctness
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.2007.02.013openalex-snapshot
Remarks on Testing Probabilistic Processes
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.10.002openalex-snapshot
Uniform Logical Characterizations of Testing Equivalences for Nondeterministic, Probabilistic and Markovian Processes
inferred← citeshttps://doi.org/10.1016/j.ic.2010.09.007openalex-snapshot
Quantitative Kleene coalgebras
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.jlap.2013.05.006openalex-snapshot
Stuttering for Abstract Probabilistic Automata
inferred← citeshttps://doi.org/10.1016/j.peva.2011.11.003openalex-snapshot
New results for Constraint Markov Chains
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.05.010openalex-snapshot
Constraint Markov Chains
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.12.003openalex-snapshot
Constructive logical characterizations of bisimilarity for reactive probabilistic systems
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00038-6openalex-snapshot
On the verification of qualitative properties of probabilistic processes under fairness constraints
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.1016/s0304-3975(97)00127-8openalex-snapshot
A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80358-xopenalex-snapshot
GSOS for probabilistic transition systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80603-6openalex-snapshot
The Essence of Coin Lemmas
inferred← citeshttps://doi.org/10.1017/s0960129511000375openalex-snapshot
Characteristic formulae for fixed-point semantics: a general framework
inferred← citeshttps://doi.org/10.1080/00222933208673535openalex-snapshot
LXI.—On the identity of some ants from Ceylon described by F. Walker
inferred← citeshttps://doi.org/10.1109/32.962559openalex-snapshot
Performance evaluation of mobile processes via abstract machines
inferred← citeshttps://doi.org/10.1109/apsec.2018.00027openalex-snapshot
Scalable Verification Framework for C Program
inferred← citeshttps://doi.org/10.1109/apsec53868.2021.00058openalex-snapshot
Probabilistic testing of asynchronously communicating systems
inferred← citeshttps://doi.org/10.1109/eco-friendly.2014.49openalex-snapshot
A Survey on Process Algebraic Stochastic Modelling of Large Distributed Systems for Its Performance Analysis
inferred← citeshttps://doi.org/10.1109/fcst.2009.37openalex-snapshot
A Local Algorithm for Checking Probabilistic Bisimilarity
inferred← citeshttps://doi.org/10.1109/iceccs.2014.49openalex-snapshot
A Survey on Process Algebraic Stochastic Modelling of Large Distributed Systems for Its Performance Analysis
inferred← citeshttps://doi.org/10.1109/icmult.2010.5630839openalex-snapshot
Improved PKI Solution for Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/lics.2007.22openalex-snapshot
Game Relations and Metrics
inferred← citeshttps://doi.org/10.1109/lics.2009.12openalex-snapshot
Trace Semantics is Fully Abstract
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470526openalex-snapshot
In search of lost time: Axiomatising parallel composition in process algebras
inferred← citeshttps://doi.org/10.1109/memcod.2004.1459815openalex-snapshot
PROBMELA: a modeling language for communicating probabilistic processes
inferred← citeshttps://doi.org/10.1109/qest.2010.23openalex-snapshot
Compositional Design Methodology with Constraint Markov Chains
inferred← citeshttps://doi.org/10.1109/sew.2012.16openalex-snapshot
Dogfooding the structural operational semantics of mCRL2
inferred← citeshttps://doi.org/10.1145/234528.234748openalex-snapshot
Enhanced operational semantics
inferred← citeshttps://doi.org/10.1145/3529535openalex-snapshot
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
inferred← citeshttps://doi.org/10.2168/lmcs-4(3:7)2008openalex-snapshot
Game Refinement Relations and Metrics
inferred← citeshttps://doi.org/10.25560/6348openalex-snapshot
Finite-State Abstractions for Probabilistic Computation Tree Logic
inferred← citeshttps://doi.org/10.4204/eptcs.8.1openalex-snapshot
Characteristic Formulae for Fixed-Point Semantics: A General Framework
inferred← citeshttps://doi.org/10.4230/lipics.csl.2011.144openalex-snapshot
Continuous Markovian Logic - From Complete Axiomatization to the Metric Space of Formulas
inferred← citeshttps://doi.org/10.48550/arxiv.1103.4577openalex-snapshot
Logical, Metric, and Algorithmic Characterisations of Probabilistic Bisimulation
inferred← citeshttps://doi.org/10.7146/brics.v14i2.21925openalex-snapshot
Characteristic Formulae: From Automata to Logic
inferred← citeshttps://doi.org/10.7146/brics.v6i24.20093openalex-snapshot
Conservative Extension in Structural Operational Semantics
inferred← citeshttps://doi.org/10.7146/brics.v6i30.20099openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.7146/brics.v9i6.21724openalex-snapshot
Equational Axioms for Probabilistic Bisimilarity (Preliminary Report)
inferred← citeshttps://doi.org/10.7146/dpb.v21i417.6730openalex-snapshot
Design, analysis and Reasoning about Tools: Abstracts from the Second Workshop (Aalborg, 1992, 20-21 August)
inferred← citeshttps://doi.org/10.7146/dpb.v22i457.6930openalex-snapshot
Design, Analysis and Reasoning about Tools: Abstracts from the Third Workshop
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.