On the public citation graph

Testing equivalences and fully abstract models for probabilistic processes

https://doi.org/10.1007/bfb0039056
0 signed · 104 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-09526-8_8openalex-snapshot
Full abstraction for a simple parallel programming language
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/978-3-642-82921-5_4openalex-snapshot
Notes on Communicating Sequential Systems
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.1016/0304-3975(84)90113-0openalex-snapshot
Testing equivalences for processes
inferredcites →https://doi.org/10.1016/0304-3975(87)90065-xopenalex-snapshot
Observation equivalence as a testing equivalence
inferredcites →https://doi.org/10.1016/0304-3975(87)90117-4openalex-snapshot
Refusal testing
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.1109/lics.1990.113740openalex-snapshot
Reactive, generative, and stratified models of probabilistic processes
inferredcites →https://doi.org/10.1145/75277.75291openalex-snapshot
A fully abstract trace model for dataflow networks
inferredcites →https://doi.org/10.1145/75277.75307openalex-snapshot
Bisimulation through probabilistic testing (preliminary report)

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.2001.2962openalex-snapshot
Bisimulation for Labelled Markov Processes
inferred← citeshttps://doi.org/10.1006/jcss.1999.1683openalex-snapshot
Deciding Bisimilarity and Similarity for Probabilistic Processes
inferred← citeshttps://doi.org/10.1007/11754008_6openalex-snapshot
Customized Testing for Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/11888116_33openalex-snapshot
Derivation of a Suitable Finite Test Suite for Customized Probabilistic Systems
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-44685-0_22openalex-snapshot
A Testing Theory for Generally Distributed Stochastic Processes
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_38openalex-snapshot
A Testing Scenario for Probabilistic Automata
inferred← citeshttps://doi.org/10.1007/3-540-48778-6_1openalex-snapshot
Fully Abstract Characterization of Probabilistic May Testing
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_20openalex-snapshot
Compositional Verification of Randomized Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-55092-5_27openalex-snapshot
Translating timed process algebra into prioritized process algebra
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_30openalex-snapshot
Efficient algorithms for verification of equivalences for probabilistic processes
inferred← citeshttps://doi.org/10.1007/3-540-56287-7_117openalex-snapshot
Reasoning about safety and liveness properties for probabilistic processes
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_101openalex-snapshot
A fully parallel calculus of synchronizing processes
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-60630-0_9openalex-snapshot
Analytic and locally approximate solutions to properties of 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-63166-6_14openalex-snapshot
Weak bisimulation for fully probabilistic processes
inferred← citeshttps://doi.org/10.1007/978-0-387-35578-8_8openalex-snapshot
Fair Testing Through Probabilistic Testing
inferred← citeshttps://doi.org/10.1007/978-1-84800-223-4_3openalex-snapshot
Stochastically Timed Process Algebra
inferred← citeshttps://doi.org/10.1007/978-3-030-21485-2_7openalex-snapshot
Genesis and Evolution of ULTraS: Metamodel, Metaequivalences, Metaresults
inferred← citeshttps://doi.org/10.1007/978-3-030-72016-2openalex-snapshot
Tools and Algorithms for the Construction and Analysis of Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-72044-4_7openalex-snapshot
Model-Based Testing of Quantum Computations
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-24611-4_3openalex-snapshot
An Overview of Probabilistic Process Algebras and Their Equivalences
inferred← citeshttps://doi.org/10.1007/978-3-540-31848-4_4openalex-snapshot
Testing of Symbolic-Probabilistic Systems
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-48654-1_37openalex-snapshot
Composition and Behaviors of Probabilistic I/O Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-68855-6_17openalex-snapshot
A Hierarchy of Equivalences for Probabilistic Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-72522-0_5openalex-snapshot
A Survey of Markovian Behavioral Equivalences
inferred← citeshttps://doi.org/10.1007/978-3-540-79980-1_27openalex-snapshot
Non Expansive ε-Bisimulations
inferred← citeshttps://doi.org/10.1007/978-3-642-13464-7_6openalex-snapshot
Testing Probabilistic Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_20openalex-snapshot
Characterising Probabilistic Processes Logically
inferred← citeshttps://doi.org/10.1007/978-3-642-28729-9_13openalex-snapshot
Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
inferred← citeshttps://doi.org/10.1007/978-3-662-45198-4_3openalex-snapshot
Probabilistic Bisimulation
inferred← citeshttps://doi.org/10.1007/978-3-662-45198-4_4openalex-snapshot
Probabilistic Testing Semantics
inferred← citeshttps://doi.org/10.1007/bf01211557openalex-snapshot
LOTOS extended with probabilistic behaviours
inferred← citeshttps://doi.org/10.1007/bf01211867openalex-snapshot
Processes with probabilities, priority and time
inferred← citeshttps://doi.org/10.1007/bfb0039050openalex-snapshot
Ideal specification formalism = expressivity + compositionality + decidability + testability + ...
inferred← citeshttps://doi.org/10.1007/s00165-012-0244-5openalex-snapshot
Using schedulers to test probabilistic distributed systems
inferred← citeshttps://doi.org/10.1007/s00446-007-0034-0openalex-snapshot
Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
inferred← citeshttps://doi.org/10.1016/0164-1212(94)00059-vopenalex-snapshot
A model for timed-probabilistic behaviors
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.2005.10.042openalex-snapshot
Trace Machines for Observing Continuous-Time 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.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.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.2007.02.002openalex-snapshot
Non-bisimulation-based Markovian behavioral equivalences
inferred← citeshttps://doi.org/10.1016/j.jss.2017.03.011openalex-snapshot
Implementation relations and probabilistic schedulers in the distributed test architecture
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.047openalex-snapshot
Specification, testing and implementation relations for symbolic-probabilistic systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.01.027openalex-snapshot
Non-expansive ϵ -bisimulations for probabilistic processes
inferred← citeshttps://doi.org/10.1016/s0169-7552(96)00017-7openalex-snapshot
Conformance testing with labelled transition systems: Implementation relations and test generation
inferred← citeshttps://doi.org/10.1016/s0169-7552(97)00134-7openalex-snapshot
Partial order models for quantitative extensions of LOTOS
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00044-5openalex-snapshot
Testing preorders for probabilistic processes can be characterized by simulations
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(97)00056-xopenalex-snapshot
Composition and behaviors of probabilistic I/O automata
inferred← citeshttps://doi.org/10.1016/s0928-4869(98)00013-5openalex-snapshot
Exact, analytic, and locally approximate solutions to discrete event-simulation problems
inferred← citeshttps://doi.org/10.1016/s1567-8326(02)00040-1openalex-snapshot
Algebraic theory of probabilistic and nondeterministic processes
inferred← citeshttps://doi.org/10.1016/s1567-8326(02)00069-3openalex-snapshot
Algebraic theory of probabilistic processes
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80038-6openalex-snapshot
Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80465-7openalex-snapshot
Domain Equations for Probabilistic Processes (Extended Abstract)
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80599-7openalex-snapshot
Denotational Semantics for Probabilistic Refusal Testing
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80603-6openalex-snapshot
The Essence of Coin Lemmas
inferred← citeshttps://doi.org/10.1017/s0960129507006408openalex-snapshot
A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems
inferred← citeshttps://doi.org/10.1017/s0960129599002984openalex-snapshot
Domain equations for probabilistic processes
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/apsec51365.2020.00060openalex-snapshot
Asynchronous test equivalence for probabilistic processes
inferred← citeshttps://doi.org/10.1109/cit.2010.122openalex-snapshot
Quantifying Information Leakage for Fully Probabilistic Systems
inferred← citeshttps://doi.org/10.1109/fcst.2009.37openalex-snapshot
A Local Algorithm for Checking Probabilistic Bisimilarity
inferred← citeshttps://doi.org/10.1109/lics.1991.151651openalex-snapshot
Specification and refinement of probabilistic processes
inferred← citeshttps://doi.org/10.1109/lics.1995.523277openalex-snapshot
Compositional testing preorders for probabilistic processes
inferred← citeshttps://doi.org/10.1109/lics.1997.614943openalex-snapshot
Bisimulation for labelled Markov processes
inferred← citeshttps://doi.org/10.1109/lics.2007.15openalex-snapshot
Characterising Testing Preorders for Finite Probabilistic Processes
inferred← citeshttps://doi.org/10.1109/lics.2009.12openalex-snapshot
Trace Semantics is Fully Abstract
inferred← citeshttps://doi.org/10.1109/qest.2011.32openalex-snapshot
Controlling Modelling Artifacts
inferred← citeshttps://doi.org/10.1109/real.1990.128759openalex-snapshot
A calculus for communicating systems with time and probabilities
inferred← citeshttps://doi.org/10.1109/tse.2016.2527000openalex-snapshot
Probabilistic Interface Automata
inferred← citeshttps://doi.org/10.1145/1314690.1314693openalex-snapshot
A testing scenario for probabilistic processes
inferred← citeshttps://doi.org/10.1145/1595696.1595760openalex-snapshot
Probabilistic environments in the quantitative analysis of (non-probabilistic) behaviour models
inferred← citeshttps://doi.org/10.2168/lmcs-10(1:16)2014openalex-snapshot
Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
inferred← citeshttps://doi.org/10.2168/lmcs-4(4:4)2008openalex-snapshot
Characterising Testing Preorders for Finite Probabilistic Processes
inferred← citeshttps://doi.org/10.22028/d291-25945openalex-snapshot
Decision algorithms for probabilistic simulations
inferred← citeshttps://doi.org/10.3990/1.9789036507998openalex-snapshot
Quantitative and Qualitative Extensions of Event Structures
inferred← citeshttps://doi.org/10.3990/1.9789090056432openalex-snapshot
A formal approach to conformance testing
inferred← citeshttps://doi.org/10.4204/eptcs.13.2openalex-snapshot
Markovian Testing Equivalence and Exponentially Timed Internal Actions
inferred← citeshttps://doi.org/10.4204/eptcs.28.7openalex-snapshot
Testing Reactive Probabilistic Processes
inferred← citeshttps://doi.org/10.4230/lipics.calco.2015.253openalex-snapshot
Generic Trace Semantics and Graded Monads
inferred← citeshttps://doi.org/10.48550/arxiv.1103.4577openalex-snapshot
Logical, Metric, and Algorithmic Characterisations of Probabilistic Bisimulation
inferred← citeshttps://doi.org/10.6100/ir716397openalex-snapshot
Probability and hiding in concurrent processes
inferred← citeshttps://doi.org/10.7146/brics.v4i4.18783openalex-snapshot
Bisimulation for Labelled Markov Processes
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.