A Unifying Approach to Probabilistic Testing Equivalences | Paper Citation Record

Observation 221fef73-5697-452a-bb3e-dfbd12d33d87 · outbound

This paper cites Boreale, R.

A Unifying Approach to Probabilistic Testing Equivalences Boreale, R

Reference 1

Resolution: verified exact; arxiv_id, observed 2026-05-19T03:32:01.193830Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation aa3d27c0-0549-4df7-bffc-8e283ff432d6 · outbound

This paper cites De Nicola, M.

A Unifying Approach to Probabilistic Testing Equivalences De Nicola, M

Reference 2

Resolution: verified exact; doi, observed 2026-05-19T03:32:01.184642Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation c08330e2-6d25-484f-a081-becf37e59d29 · outbound

This paper cites Brinksma, A.

A Unifying Approach to Probabilistic Testing Equivalences Brinksma, A

Reference 3

Resolution: verified exact; doi, observed 2026-05-19T03:32:01.166900Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 2c0b3e51-dc5e-4a75-8f11-117bf118b682 · outbound

This paper cites Natarajan, R.

A Unifying Approach to Probabilistic Testing Equivalences Natarajan, R

Reference 4

Resolution: verified exact; doi, observed 2026-05-19T03:32:01.197312Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 682d7d6d-2049-4a90-9246-09ca3a014b53 · outbound

This paper cites Baier, J.-P.

A Unifying Approach to Probabilistic Testing Equivalences Baier, J.-P

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.779111Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation ad2f5ae5-3d6c-4e8c-9d06-b5fc12b9e28f · outbound

This paper cites Araujo, M.

A Unifying Approach to Probabilistic Testing Equivalences Araujo, M

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.949694Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation a2ef36c4-b601-4d9c-a98d-3fa084614496 · outbound

This paper cites Cheung, M.

A Unifying Approach to Probabilistic Testing Equivalences Cheung, M

Reference 7

Resolution: verified exact; arxiv_id, observed 2026-05-19T03:32:01.179688Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 7278b29c-700d-43f4-924b-d548aca417e9 · outbound

This paper cites an unresolved cited work.

A Unifying Approach to Probabilistic Testing Equivalences Unresolved cited work

Reference 8

Resolution: unresolved; raw_fallback, observed 2026-05-19T03:32:57.843142Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 02e78f06-3b37-4cb4-a8c1-4a46f89ef797 · outbound

This paper cites Gerhold, M.

A Unifying Approach to Probabilistic Testing Equivalences Gerhold, M

Reference 9

Resolution: verified exact; doi, observed 2026-05-19T03:32:01.173842Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 71f60b79-87dd-49fd-b5d6-49990cd2c659 · outbound

This paper cites Crafa, F.

A Unifying Approach to Probabilistic Testing Equivalences Crafa, F

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.851554Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 033efd55-8bcc-4e4d-9bf2-d44162243407 · outbound

This paper cites Etessami, M.

A Unifying Approach to Probabilistic Testing Equivalences Etessami, M

Reference 11

Resolution: verified exact; doi, observed 2026-05-19T03:32:01.204820Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 75c0762d-d7fb-4b3c-a7b8-e5509babf0eb · outbound

This paper cites Fu, Model independent approach to probabilistic models, Theoretical Computer Science 869 (2021) 181–194.

A Unifying Approach to Probabilistic Testing Equivalences Fu, Model independent approach to probabilistic models, Theoretical Computer Science 869 (2021) 181–194

Reference 12

Resolution: verified exact; doi, observed 2026-05-19T03:32:01.117197Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 4bf895f0-81d1-4e30-bd0c-dbced86ab87c · outbound

This paper cites an unresolved cited work.

A Unifying Approach to Probabilistic Testing Equivalences Unresolved cited work

Reference 13

Resolution: verified exact; arxiv_id, observed 2026-05-19T03:32:01.157109Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 6fe7017f-4678-4bbf-9658-ce7da1b1bafa · outbound

This paper cites Zhang, H.

A Unifying Approach to Probabilistic Testing Equivalences Zhang, H

Reference 14

Resolution: verified exact; doi, observed 2026-05-19T03:32:01.138650Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 48325f79-0c9d-4490-9ba5-5c0475806c61 · outbound

This paper cites Cattani, R.

A Unifying Approach to Probabilistic Testing Equivalences Cattani, R

Reference 15

Resolution: verified exact; doi, observed 2026-05-19T03:32:01.141765Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation de5a6d2e-d890-43bf-a0ae-6faaf30888b2 · outbound

This paper cites Segala, Modeling and Verification of Randomized Distributed Real-Time Systems, Thesis, Massachusetts Institute of Technology (1995).

A Unifying Approach to Probabilistic Testing Equivalences Segala, Modeling and Verification of Randomized Distributed Real-Time Systems, Thesis, Massachusetts Institute of Technology (1995)

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.847101Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 6627a369-f540-494d-b496-2c82e6051e22 · outbound

This paper cites Turrini, H.

A Unifying Approach to Probabilistic Testing Equivalences Turrini, H

Reference 17

Resolution: verified exact; doi, observed 2026-05-19T03:32:01.120897Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation e8e29e40-a932-49bd-adbb-948d7a117ed0 · outbound

This paper cites Deng, Semantics of Probabilistic Processes, Springer Berlin Heidelberg, Berlin, Heidelberg.

A Unifying Approach to Probabilistic Testing Equivalences Deng, Semantics of Probabilistic Processes, Springer Berlin Heidelberg, Berlin, Heidelberg

Reference 18

Resolution: malformed identifier; raw_fallback, observed 2026-05-19T03:32:57.865984Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 023ee06a-68ff-4a42-ad7a-dc0bf50d224e · outbound

This paper cites Fu, Theory of interaction, Theoretical Computer Science 611 (2016) 1–49.

A Unifying Approach to Probabilistic Testing Equivalences Fu, Theory of interaction, Theoretical Computer Science 611 (2016) 1–49

Reference 19

Resolution: verified exact; doi, observed 2026-05-19T03:32:01.188179Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 5fef5bd7-9948-451e-a4ed-26e4eb6bad4e · outbound

This paper cites The Name-Passing Calculus.

A Unifying Approach to Probabilistic Testing Equivalences The Name-Passing Calculus

Reference 20

Resolution: verified exact; local_arxiv, observed 2026-05-19T03:32:01.125882Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 97398e00-35f1-4b82-af76-b329ea3965f1 · outbound

This paper cites Milner, Communication and Concurrency, Prentice-Hall, Inc.

A Unifying Approach to Probabilistic Testing Equivalences Milner, Communication and Concurrency, Prentice-Hall, Inc

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.855200Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation cd8e15a3-cc30-41e1-9cc6-8c4e53fdfc77 · outbound

This paper cites an unresolved cited work.

A Unifying Approach to Probabilistic Testing Equivalences Unresolved cited work

Reference 22

Resolution: verified exact; arxiv_id, observed 2026-05-19T03:32:01.163334Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 08f4012a-d218-471c-ba2b-332b72e977d4 · outbound

This paper cites The linear time - branching time spectrum II,.

A Unifying Approach to Probabilistic Testing Equivalences The linear time - branching time spectrum II,

Reference 23

Resolution: verified exact; doi, observed 2026-05-19T03:32:01.129858Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 2c60aa9f-7fec-4182-8316-0274d4ccfec2 · outbound

This paper cites Cleaveland, Z.

A Unifying Approach to Probabilistic Testing Equivalences Cleaveland, Z

Reference 24

Resolution: verified exact; arxiv_id, observed 2026-05-19T03:32:01.147325Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation b8708200-d561-46f2-bd6b-56a8a52c7e9c · outbound

This paper cites Analyzing Divergence for Nondeterministic Probabilistic Models.

A Unifying Approach to Probabilistic Testing Equivalences Analyzing Divergence for Nondeterministic Probabilistic Models

Reference 25

Resolution: verified exact; arxiv_id, observed 2026-05-19T03:32:01.135148Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 81bf99d7-42d8-4b3b-a959-201a8e41c1e9 · outbound

This paper cites an unresolved cited work.

A Unifying Approach to Probabilistic Testing Equivalences Unresolved cited work

Reference 26

Resolution: verified exact; doi, observed 2026-05-19T03:32:01.170624Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 0b192417-5e56-436e-a936-7cba4bba77e3 · outbound

This paper cites an unresolved cited work.

A Unifying Approach to Probabilistic Testing Equivalences Unresolved cited work

Reference 27

Resolution: verified exact; doi, observed 2026-05-19T03:32:01.200672Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 016a21fe-842a-49ba-a841-50d7a58bcb2e · outbound

This paper cites Arora, B.

A Unifying Approach to Probabilistic Testing Equivalences Arora, B

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.847587Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 4d8feafd-f6c9-4bee-89dd-85b27bba6cbe · outbound

This paper cites an unresolved cited work.

A Unifying Approach to Probabilistic Testing Equivalences Unresolved cited work

Reference 29

Resolution: unresolved; raw_fallback, observed 2026-05-19T03:32:57.828625Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation cbed8cdc-bdea-4ff8-a8e9-aad366e1098d · outbound

This paper cites Dal Lago, M.

A Unifying Approach to Probabilistic Testing Equivalences Dal Lago, M

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.872911Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 1513cc33-3ff3-483d-b1e5-de33fc3e54e9 · outbound

This paper cites Spork, C.

A Unifying Approach to Probabilistic Testing Equivalences Spork, C

Reference 31

Resolution: verified exact; doi, observed 2026-05-19T03:32:01.151111Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 9a02153b-ccec-45a1-9b3d-50084a2e27b7 · outbound

This paper cites Bernardo, R.

A Unifying Approach to Probabilistic Testing Equivalences Bernardo, R

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.938854Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 55ecebf8-4cc2-495d-b9ab-5551231e4225 · outbound

This paper cites Bernardo, et al., Probabilistic trace and testing semantics: The importance of being coherent, Foundations and Trends® in Programming Languages 7 (4) (2022) 244–332.

A Unifying Approach to Probabilistic Testing Equivalences Bernardo, et al., Probabilistic trace and testing semantics: The importance of being coherent, Foundations and Trends® in Programming Languages 7 (4) (2022) 244–332

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.876020Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 55d94132-73d1-4231-9f67-fd4a6f0f4a81 · outbound

This paper cites The base case is trivial.

A Unifying Approach to Probabilistic Testing Equivalences The base case is trivial

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.851036Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 52824b8e-0df8-41a2-ac36-b54d80954909 · outbound

This paper cites Note that pν′ 1(P ) + (1 − p)ν2(P ) ̸= 0 for p ∈ (0, 1).

A Unifying Approach to Probabilistic Testing Equivalences Note that pν′ 1(P ) + (1 − p)ν2(P ) ̸= 0 for p ∈ (0, 1)

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.931714Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 5d400b2c-2fa3-4c99-8c55-4b9113520ec7 · outbound

This paper cites In the base case where |π| = 0, set ν1 = µ, ν2 = µ, and the result follows.

A Unifying Approach to Probabilistic Testing Equivalences In the base case where |π| = 0, set ν1 = µ, ν2 = µ, and the result follows

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.869283Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation b621cf98-864a-43e1-bfae-4ec2b6853f63 · outbound

This paper cites Assume, without loss of generality, that ν′ 1(φ) ≤ ν(φ) ≤ ν′ 2(φ).

A Unifying Approach to Probabilistic Testing Equivalences Assume, without loss of generality, that ν′ 1(φ) ≤ ν(φ) ≤ ν′ 2(φ)

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.859373Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 321ddff0-5dc8-4e3f-a807-4bd9b3ba9038 · outbound

This paper cites an unresolved cited work.

A Unifying Approach to Probabilistic Testing Equivalences Unresolved cited work

Reference 38

Resolution: unresolved; raw_fallback, observed 2026-05-19T03:32:57.870004Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 19fde83d-9f31-43b6-8164-9bd5e5389b23 · outbound

This paper cites There exists an external action li ∈ L ∪ L and a distribution ρi such that Ai li − − →ρi.

A Unifying Approach to Probabilistic Testing Equivalences There exists an external action li ∈ L ∪ L and a distribution ρi such that Ai li − − →ρi

Reference 39

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.874090Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 91bcbe7f-e423-447e-b5b1-9ff460e04e45 · outbound

This paper cites If no such division exists, break from this procedure.

A Unifying Approach to Probabilistic Testing Equivalences If no such division exists, break from this procedure

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.835848Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation ccaa2492-1e5a-4844-8bb1-07b24975c9f3 · outbound

This paper cites By Corollary 3 (2), there exists µ1, µ2 such that µ′−µ′(P L)δP L 1−µ′(P L) ⇝ µ1, ρ ⇝ µ2, and νj = (1 − µ′(P L))µ1 + µ′(P L)µ2.

A Unifying Approach to Probabilistic Testing Equivalences By Corollary 3 (2), there exists µ1, µ2 such that µ′−µ′(P L)δP L 1−µ′(P L) ⇝ µ1, ρ ⇝ µ2, and νj = (1 − µ′(P L))µ1 + µ′(P L)µ2

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.801898Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation e17aa4b6-c309-4539-b346-16599eaf0e08 · outbound

This paper cites Besides, by µ′′(X1) = νj(X1) and monotonicity, we have µ1(X1) = µ′ − µ′(P L)δP L 1 − µ′(P L) (X1) = µ′(X1) − µ′(P L) 1 − µ′(P L).

A Unifying Approach to Probabilistic Testing Equivalences Besides, by µ′′(X1) = νj(X1) and monotonicity, we have µ1(X1) = µ′ − µ′(P L)δP L 1 − µ′(P L) (X1) = µ′(X1) − µ′(P L) 1 − µ′(P L)

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.928706Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 1bbbe927-e441-4185-ba7e-7570f44ff912 · outbound

This paper cites an unresolved cited work.

A Unifying Approach to Probabilistic Testing Equivalences Unresolved cited work

Reference 43

Resolution: unresolved; raw_fallback, observed 2026-05-19T03:32:57.814056Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 8e6e6cd3-7928-419c-b3e9-bd1326b030f8 · outbound

This paper cites an unresolved cited work.

A Unifying Approach to Probabilistic Testing Equivalences Unresolved cited work

Reference 44

Resolution: unresolved; raw_fallback, observed 2026-05-19T03:32:57.805462Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 5747c3a7-c081-49d7-9425-898ff9ec4469 · outbound

This paper cites an unresolved cited work.

A Unifying Approach to Probabilistic Testing Equivalences Unresolved cited work

Reference 45

Resolution: unresolved; raw_fallback, observed 2026-05-19T03:32:57.832576Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 10e0f08b-c96b-4482-bc84-966da7aa10bf · outbound

This paper cites an unresolved cited work.

A Unifying Approach to Probabilistic Testing Equivalences Unresolved cited work

Reference 46

Resolution: unresolved; raw_fallback, observed 2026-05-19T03:32:57.838964Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 37a462a3-05fd-43a5-8ac9-b204c8684ae3 · outbound

This paper cites an unresolved cited work.

A Unifying Approach to Probabilistic Testing Equivalences Unresolved cited work

Reference 47

Resolution: unresolved; raw_fallback, observed 2026-05-19T03:32:57.945500Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation da855818-b914-4239-a522-4879c891fb3f · outbound

This paper cites Therefore, ( µ1 | ν) = D may (µ2 | ν) and ( L)µ1 =D may (L)µ2, which implies that the equivalence = D may is D- extensional.

A Unifying Approach to Probabilistic Testing Equivalences Therefore, ( µ1 | ν) = D may (µ2 | ν) and ( L)µ1 =D may (L)µ2, which implies that the equivalence = D may is D- extensional

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.934690Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation c14f0887-7bdf-4ba3-8f71-ef849b413216 · outbound

This paper cites Thus, δP |OL τ − − →ρP | δω and (ρP | δω)(ψω) = 1.

A Unifying Approach to Probabilistic Testing Equivalences Thus, δP |OL τ − − →ρP | δω and (ρP | δω)(ψω) = 1

Reference 49

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.809673Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation f8348804-a2b6-4d86-81bf-fabf26e667c7 · outbound

This paper cites Since ν | oL =P P ∈supp(ν) ν(P )δP |OL, by Corollary 3, we have µ | oL ⇝ ν | oL ⇝ ν′ := X P ∈ψL∩supp(ν) ν(P )(ρP | δω) + X P ∈ψL∩supp(ν) ν(P )δP |OL.

Reference 50

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.781858Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 4f1511d8-2f52-44cd-ae5d-31e5ff76be94 · outbound

This paper cites an unresolved cited work.

A Unifying Approach to Probabilistic Testing Equivalences Unresolved cited work

Reference 51

Resolution: unresolved; raw_fallback, observed 2026-05-19T03:32:57.832005Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 5c904724-fb1b-49a7-8a64-52b34c1d0df4 · outbound

This paper cites Therefore, sup OQ ω = 1 for any Q ∈ ψL.

A Unifying Approach to Probabilistic Testing Equivalences Therefore, sup OQ ω = 1 for any Q ∈ ψL

Reference 52

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.814311Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 8b725129-7736-4fb6-b846-8b2a3705016f · outbound

This paper cites Since L must be finite, by Lemma 14, we have χmay L (µ1) = χmay ω (µ1 | oL) = χmay ω (µ2 | oL) = χmay L (µ2).

A Unifying Approach to Probabilistic Testing Equivalences Since L must be finite, by Lemma 14, we have χmay L (µ1) = χmay ω (µ1 | oL) = χmay ω (µ2 | oL) = χmay L (µ2)

Reference 53

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.865370Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 25e2f211-397f-48ff-96a1-2e07d2c91415 · outbound

This paper cites (A.18) Therefore, the equivalence = D fair is probabilistically strongly equipollent.

A Unifying Approach to Probabilistic Testing Equivalences (A.18) Therefore, the equivalence = D fair is probabilistically strongly equipollent

Reference 54

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:02.778771Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 9f14c710-7038-4f79-874c-961670bb9816 · outbound

This paper cites For any µ1, µ2 such that µ1 R◦ µ2, we assume that µ1 = ϑ P i∈I ai.P1,i and µ2 = ϑ P i∈I ai.P2,i , where ϑ is a 1-ary distribution containing only one occurrence of X.

A Unifying Approach to Probabilistic Testing Equivalences For any µ1, µ2 such that µ1 R◦ µ2, we assume that µ1 = ϑ P i∈I ai.P1,i and µ2 = ϑ P i∈I ai.P2,i , where ϑ is a 1-ary distribution containing only one occurrence of X

Reference 55

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.761457Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation ec13a270-50c2-491a-987c-792756ed48d6 · outbound

This paper cites Note that δL i∈I pi.Pi τ − − →P i∈I piδPi and we have proved that =p ♢ is preserved by convex combinations.

A Unifying Approach to Probabilistic Testing Equivalences Note that δL i∈I pi.Pi τ − − →P i∈I piδPi and we have proved that =p ♢ is preserved by convex combinations

Reference 56

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:02.775879Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation b98fdc30-e2e8-4ab7-be61-c678343021f8 · outbound

This paper cites an unresolved cited work.

A Unifying Approach to Probabilistic Testing Equivalences Unresolved cited work

Reference 57

Resolution: unresolved; raw_fallback, observed 2026-05-19T03:32:57.772130Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation f76942e7-7a16-491a-a8de-e8e9df8760c2 · outbound

This paper cites Proof of claim.

A Unifying Approach to Probabilistic Testing Equivalences Proof of claim

Reference 58

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.738991Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 6540d4df-f587-4c7d-8762-35ac6c8dbbb5 · outbound

This paper cites Then ν1 = ϑ[µX.τ.S ].

A Unifying Approach to Probabilistic Testing Equivalences Then ν1 = ϑ[µX.τ.S ]

Reference 59

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:02.781498Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 2367c06d-c276-4901-834c-8725c7eae727 · outbound

This paper cites By statement (1), we can w.l.o.g.

A Unifying Approach to Probabilistic Testing Equivalences By statement (1), we can w.l.o.g

Reference 60

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:02.764545Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation a5528cd6-5e48-4241-9c00-1cf0e15897ad · outbound

This paper cites an unresolved cited work.

A Unifying Approach to Probabilistic Testing Equivalences Unresolved cited work

Reference 61

Resolution: unresolved; raw_fallback, observed 2026-05-19T03:32:57.757759Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 16965542-74c4-47b5-a96a-aef4b2e0a57e · outbound

This paper cites an unresolved cited work.

A Unifying Approach to Probabilistic Testing Equivalences Unresolved cited work

Reference 62

Resolution: unresolved; raw_fallback, observed 2026-05-19T03:32:57.768589Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 3b3e5cc8-5424-4bc5-a999-db73a567c3b5 · outbound

This paper cites Therefore, for any transition sequence ϑ[µX.T ] τ k − − →ν1, we can prove by induction on k that ν1(ψL) ≤ χmay L (ϑ[µX.τ.T ]).

A Unifying Approach to Probabilistic Testing Equivalences Therefore, for any transition sequence ϑ[µX.T ] τ k − − →ν1, we can prove by induction on k that ν1(ψL) ≤ χmay L (ϑ[µX.τ.T ])

Reference 63

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.764882Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 7504999c-8444-40fd-8404-9950815bef54 · outbound

This paper cites Now we see that δP ′(ψL) = 1 for some transition sequence δP ⇝ δP ′, and thus χmay L (P ) = 1.

A Unifying Approach to Probabilistic Testing Equivalences Now we see that δP ′(ψL) = 1 for some transition sequence δP ⇝ δP ′, and thus χmay L (P ) = 1

Reference 64

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:02.787666Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 7f285150-8d84-4803-a28f-1651b5642474 · outbound

This paper cites Consider any transition sequence δP ⇝ ν with witness π, we can prove that supp(ν) ⊆ Reachτ(P ) by induction on the length of π.

A Unifying Approach to Probabilistic Testing Equivalences Consider any transition sequence δP ⇝ ν with witness π, we can prove that supp(ν) ⊆ Reachτ(P ) by induction on the length of π

Reference 65

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:02.773091Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 4b11cda8-64d1-44a5-9ae8-8d8e06f52655 · outbound

This paper cites According to the above conclusion, χmay L (P ′) = 1 for all P ′ for all P ′ ∈ Reachτ(P ).

A Unifying Approach to Probabilistic Testing Equivalences According to the above conclusion, χmay L (P ′) = 1 for all P ′ for all P ′ ∈ Reachτ(P )

Reference 66

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:02.762006Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 111db647-18db-42b9-9532-2a7c86d0f67f · outbound

This paper cites By our first equality, we have χmay L (P ′) = 0.

A Unifying Approach to Probabilistic Testing Equivalences By our first equality, we have χmay L (P ′) = 0

Reference 67

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:02.759262Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation be7c9f86-16d4-4d57-b69c-da16a331a4ea · outbound

This paper cites an unresolved cited work.

A Unifying Approach to Probabilistic Testing Equivalences Unresolved cited work

Reference 68

Resolution: unresolved; raw_fallback, observed 2026-05-19T03:32:57.735331Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation c5427e2c-d62e-4320-a02b-b6679ba5d7ce · outbound

This paper cites By Lemma 23, we can deduce that (=∆ ♢ )↾CCS is an extensional, equipollent relation onPCCS, which is contained in = ♢.

A Unifying Approach to Probabilistic Testing Equivalences By Lemma 23, we can deduce that (=∆ ♢ )↾CCS is an extensional, equipollent relation onPCCS, which is contained in = ♢

Reference 69

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.743164Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 8051d312-68be-49a3-9a64-5aafe22a8b53 · outbound

This paper cites By the definition of = may and Lemma 25, we have χmay ω (δP | o) = χmay ω (P | O) = χmay ω (Q | O) = χmay ω (δQ | o).

A Unifying Approach to Probabilistic Testing Equivalences By the definition of = may and Lemma 25, we have χmay ω (δP | o) = χmay ω (P | O) = χmay ω (Q | O) = χmay ω (δQ | o)

Reference 70

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.750454Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation f8d66d4d-73db-4114-bd8d-51d485557a69 · outbound

This paper cites By Lemma 25, P =may Q and thus (=∆ may)↾CCS ⊆=may.

A Unifying Approach to Probabilistic Testing Equivalences By Lemma 25, P =may Q and thus (=∆ may)↾CCS ⊆=may

Reference 71

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.747034Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation f90a87b4-4be3-4c19-aa75-36e95dffabd6 · outbound

This paper cites Since µ1 ≈p µ2 , µ1(C) = µ2(C) holds for all C ∈ P RCCS / ≈p (see Definition 3), which implies that |µ2 − µ1|≈p = 0.

A Unifying Approach to Probabilistic Testing Equivalences Since µ1 ≈p µ2 , µ1(C) = µ2(C) holds for all C ∈ P RCCS / ≈p (see Definition 3), which implies that |µ2 − µ1|≈p = 0

Reference 72

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:57.753933Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation e0533f40-01e9-45b1-a972-a4b29cc5d936 · outbound

This paper cites When |π1| = k + 1, we can divide the transition sequence into µ1 π′ 1 − − →ν′ 1 τ − − →ν1, where π1 = π′ 1 ◦ τ and π′ 1 is a degenerate witness.

A Unifying Approach to Probabilistic Testing Equivalences When |π1| = k + 1, we can divide the transition sequence into µ1 π′ 1 − − →ν′ 1 τ − − →ν1, where π1 = π′ 1 ◦ τ and π′ 1 is a degenerate witness

Reference 73

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:02.796381Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 218aeb80-d441-4856-9729-7b52cbb9e27f · outbound

This paper cites Since |ν′ 2 − ν′ 1|≈p ≤ ϵ, we have |ν′ 2([P ]) − ν′ 1([P ])| ≤ ϵ.

A Unifying Approach to Probabilistic Testing Equivalences Since |ν′ 2 − ν′ 1|≈p ≤ ϵ, we have |ν′ 2([P ]) − ν′ 1([P ])| ≤ ϵ

Reference 74

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:02.793205Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 2904c8d8-1024-409f-876d-287d8d6d03a6 · outbound

This paper cites Now consider any process Q ∈ {Q1, · · · , Qm}.

A Unifying Approach to Probabilistic Testing Equivalences Now consider any process Q ∈ {Q1, · · · , Qm}

Reference 75

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:02.790483Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation da4f6a7a-f736-4a3e-8751-2e3b0da54de0 · outbound

This paper cites Then P2 | Q α =⇒c µ2 := δP2 | ρ.

A Unifying Approach to Probabilistic Testing Equivalences Then P2 | Q α =⇒c µ2 := δP2 | ρ

Reference 76

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:02.784678Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation ceff5162-7d67-420d-a091-aea0fa0ac9bf · outbound

This paper cites Since P1 ≈p P2, there exists ρ2 ∈ D(PRCCS) such that P2 α =⇒c ρ2 and ρ1 ≈p ρ2.

A Unifying Approach to Probabilistic Testing Equivalences Since P1 ≈p P2, there exists ρ2 ∈ D(PRCCS) such that P2 α =⇒c ρ2 and ρ1 ≈p ρ2

Reference 77

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:02.770375Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 2de8790f-83a1-452d-802a-e14c0c57fd01 · outbound

This paper cites Since P1 ≈p P2, there exists ρ2 ∈ D(PRCCS) such that P2 ℓ =⇒c ρ2 and ρ1 (≈p)† ρ2.

A Unifying Approach to Probabilistic Testing Equivalences Since P1 ≈p P2, there exists ρ2 ∈ D(PRCCS) such that P2 ℓ =⇒c ρ2 and ρ1 (≈p)† ρ2

Reference 78

Resolution: verified fuzzy; raw_fallback, observed 2026-05-19T03:32:02.767267Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Coverage vector

Reference resolution

Outbound references

Pith citing papers