On the public citation graph

Testing equivalence as a bisimulation equivalence

0 signed · 124 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-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-52148-8_3openalex-snapshot
The concurrency workbench
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0167-6423(89)90044-0openalex-snapshot
Algebraic theory of processes
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/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
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(90)90048-mopenalex-snapshot
Bisimulation and divergence
inferredcites →https://doi.org/10.1016/0890-5401(91)90030-6openalex-snapshot
Bisimulation through probabilistic testing
inferredcites →https://doi.org/10.1016/s0019-9958(81)90082-6openalex-snapshot
A term model for synchronous processes
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.1988.5117openalex-snapshot
Bisimulations and divergence
inferredcites →https://doi.org/10.1137/0216062openalex-snapshot
Three Partition Refinement Algorithms
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
inferredcites →https://doi.org/10.1145/4221.4249openalex-snapshot
Acceptance trees
inferredcites →https://doi.org/10.1145/73560.73580openalex-snapshot
Bisimulation can't be traced
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.1002/047134608x.w2446openalex-snapshot
Process Algebra
inferred← citeshttps://doi.org/10.1007/11539452_23openalex-snapshot
Bisimulations Up-to for the Linear Time Branching Time Spectrum
inferred← citeshttps://doi.org/10.1007/11589976_14openalex-snapshot
CZT Support for Z Extensions
inferred← citeshttps://doi.org/10.1007/11768173_3openalex-snapshot
CSP Is a Retract of CCS
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_23openalex-snapshot
A Theory of Testing for Markovian Processes
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_24openalex-snapshot
Automated Test Generation from Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_33openalex-snapshot
Simulation Revisited
inferred← citeshttps://doi.org/10.1007/3-540-45608-2_1openalex-snapshot
Mathematical Models of Computer Security
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_20openalex-snapshot
Checking for CFFD-Preorder with Tester Processes
inferred← citeshttps://doi.org/10.1007/3-540-47813-2_5openalex-snapshot
An Abstract Schema for Equivalence-Checking Games
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_29openalex-snapshot
Generating diagnostic information for behavioral preorders
inferred← citeshttps://doi.org/10.1007/3-540-60630-0_7openalex-snapshot
Hierarchical compression for model-checking CSP or how to check 1020 dining philosophers for deadlock
inferred← citeshttps://doi.org/10.1007/3-540-60630-0_8openalex-snapshot
A front-end generator for verification tools
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_87openalex-snapshot
The NCSU Concurrency Workbench
inferred← citeshttps://doi.org/10.1007/3-540-65306-6_21openalex-snapshot
The state explosion problem
inferred← citeshttps://doi.org/10.1007/978-0-387-34988-6_28openalex-snapshot
Towards a “Practical Formal Method” for Test Derivation
inferred← citeshttps://doi.org/10.1007/978-1-84800-223-4openalex-snapshot
A Process Algebraic Approach to Software Architecture Design
inferred← citeshttps://doi.org/10.1007/978-1-84800-223-4_1openalex-snapshot
Process Algebra
inferred← citeshttps://doi.org/10.1007/978-3-030-38800-3_5openalex-snapshot
Specification-Based Testing
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-030-72016-2_1openalex-snapshot
A Game for Linear-time–Branching-time Spectroscopy
inferred← citeshttps://doi.org/10.1007/978-3-031-66149-5_5openalex-snapshot
Two Decades of Industrializing Formal Verification: The Reactis Story
inferred← citeshttps://doi.org/10.1007/978-3-031-73709-1_6openalex-snapshot
Language Equivalence from Nondeterministic to Weighted Automata—and Back
inferred← citeshttps://doi.org/10.1007/978-3-319-05032-4_6openalex-snapshot
Compliance and Testing Preorders Differ
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_32openalex-snapshot
Process Algebra and Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-25150-9_5openalex-snapshot
The Proof Technique of Unique Solutions of Contractions
inferred← citeshttps://doi.org/10.1007/978-3-319-59147-6_37openalex-snapshot
Heuristics for ROSA’s LTS Searching
inferred← citeshttps://doi.org/10.1007/978-3-540-31848-4_6openalex-snapshot
Online Testing of Real-time Systems Using Uppaal
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_22openalex-snapshot
Denotational Testing Semantics in Coinductive Form
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_31openalex-snapshot
Testing-Based Abstractions for Value-Passing Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_42openalex-snapshot
The Pairing of Contracts and Session Types
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-78917-8_3openalex-snapshot
Testing Real-Time Systems Using UPPAAL
inferred← citeshttps://doi.org/10.1007/978-3-540-85114-1_15openalex-snapshot
Improved On-the-Fly Equivalence Checking Using Boolean Equation Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_13openalex-snapshot
Contract-Directed Synthesis of Simple Orchestrators
inferred← citeshttps://doi.org/10.1007/978-3-540-87412-6_6openalex-snapshot
Towards State Space Reduction Based on T-Lumpability-Consistent Relations
inferred← citeshttps://doi.org/10.1007/978-3-540-87875-9_26openalex-snapshot
Implementation of the Conformance Relation for Incremental Development of Behavioural Models
inferred← citeshttps://doi.org/10.1007/978-3-642-03466-4_14openalex-snapshot
A Sound Observational Semantics for Modal Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-05031-2_1openalex-snapshot
Testing Real-Time Systems Using TINA
inferred← citeshttps://doi.org/10.1007/978-3-642-11623-0_16openalex-snapshot
On the Expressiveness of Refinement Settings
inferred← citeshttps://doi.org/10.1007/978-3-642-21498-1_48openalex-snapshot
Looking for a Cheaper ROSA
inferred← citeshttps://doi.org/10.1007/978-3-642-38143-0_7openalex-snapshot
External Behaviour of Systems of State Machines with Variables
inferred← citeshttps://doi.org/10.1007/978-3-642-40213-5_6openalex-snapshot
On Efficiency Preorders
inferred← citeshttps://doi.org/10.1007/bf00121261openalex-snapshot
Automatic verification of distributed systems: The process algebra approach
inferred← citeshttps://doi.org/10.1007/bf01383878openalex-snapshot
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
inferred← citeshttps://doi.org/10.1007/bf01384500openalex-snapshot
Merging behavior specifications
inferred← citeshttps://doi.org/10.1007/bf02759318openalex-snapshot
Analysis of equivalence relations of event structures with continuous time
inferred← citeshttps://doi.org/10.1007/s00165-004-0040-yopenalex-snapshot
A generalized semantics of PROMELA for abstract model checking
inferred← citeshttps://doi.org/10.1007/s00165-008-0074-7openalex-snapshot
FDR Explorer
inferred← citeshttps://doi.org/10.1007/s00165-015-0341-3openalex-snapshot
A reduced maximality labeled transition system generation for recursive Petri nets
inferred← citeshttps://doi.org/10.1007/s004460050010openalex-snapshot
Generating diagnostic information for behavioral preorders
inferred← citeshttps://doi.org/10.1007/s10009-002-0094-1openalex-snapshot
Automated test generation from timed automata
inferred← citeshttps://doi.org/10.1007/s10703-005-1631-9openalex-snapshot
Stepwise Development of Process-Algebraic Specifications in Decorated Trace Semantics
inferred← citeshttps://doi.org/10.1007/s11334-006-0021-9openalex-snapshot
State-rich model checking
inferred← citeshttps://doi.org/10.1007/s12243-008-0069-7openalex-snapshot
Behavioural models for distributed Fractal components
inferred← citeshttps://doi.org/10.1016/b978-0-444-89874-6.50023-4openalex-snapshot
Computing Diagnostic Tests for Incorrect Processes
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50024-2openalex-snapshot
Equivalence and Preorder Checking for Finite-State Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.079openalex-snapshot
Markovian Testing and Trace Equivalences Exactly Lump More Than Markovian Bisimilarity
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.08.042openalex-snapshot
FDR Explorer
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.08.014openalex-snapshot
Simulations Up-to and Canonical Preorders
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.03.074openalex-snapshot
Constrained Simulations, Nested Simulation Semantics and Counting Bisimulations
inferred← citeshttps://doi.org/10.1016/j.entcs.2012.08.006openalex-snapshot
Final Semantics for Decorated Traces
inferred← citeshttps://doi.org/10.1016/j.ic.2006.06.002openalex-snapshot
Fair testing
inferred← citeshttps://doi.org/10.1016/j.ic.2007.12.003openalex-snapshot
(Bi)simulations up-to characterise process semantics
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.jlamp.2019.04.005openalex-snapshot
Logical characterisations, rule formats and compositionality for input-output conformance simulation
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.jlap.2008.05.003openalex-snapshot
Comparing disjunctive modal transition systems with an one-selecting variant
inferred← citeshttps://doi.org/10.1016/j.jss.2015.11.020openalex-snapshot
IDF: A framework for the incremental development and conformance verification of UML active primitive components
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.05.030openalex-snapshot
Processes as formal power series: A coinductive approach to denotational semantics
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.12.012openalex-snapshot
CSP is a retract of CCS
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.05.002openalex-snapshot
Contract-based discovery of Web services modulo simple orchestrators
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00339-4openalex-snapshot
Linda-based applicative and imperative process algebras
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80813-2openalex-snapshot
Verification with the Undefined
inferred← citeshttps://doi.org/10.1017/cbo9780511777110openalex-snapshot
Introduction to Bisimulation and Coinduction
inferred← citeshttps://doi.org/10.1017/cbo9780511792588.004openalex-snapshot
The algorithmics of bisimilarity
inferred← citeshttps://doi.org/10.1017/s0960129514000449openalex-snapshot
A coalgebraic view on decorated traces
inferred← citeshttps://doi.org/10.1061/(asce)0887-3801(2000)14:1(38)openalex-snapshot
Finite State Verification of Intelligent Transportation Systems
inferred← citeshttps://doi.org/10.1109/aiccsa.2008.4493609openalex-snapshot
Test of preemptive real-time systems
inferred← citeshttps://doi.org/10.1109/iceccs.2011.20openalex-snapshot
Required Behavior of Sequence Diagrams: Semantics and Refinement
inferred← citeshttps://doi.org/10.1109/icnp.1995.524814openalex-snapshot
Verification and diagnosis of testing equivalence and reduction relation
inferred← citeshttps://doi.org/10.1109/tse.2006.82openalex-snapshot
Triggered Message Sequence Charts
inferred← citeshttps://doi.org/10.1109/tse.2016.2615311openalex-snapshot
Automated Steering of Model-Based Test Oracles to Admit Real Program Behaviors
inferred← citeshttps://doi.org/10.1109/valid.2009.31openalex-snapshot
Time-Optimal Real-Time Test Case Generation Using Prioritized Time Petri Nets
inferred← citeshttps://doi.org/10.1145/1147249.1147254openalex-snapshot
A foundation for behavioural conformance in software product line architectures
inferred← citeshttps://doi.org/10.1145/199448.199468openalex-snapshot
Reasoning about rings
inferred← citeshttps://doi.org/10.1145/2523108openalex-snapshot
Required behavior of sequence diagrams
inferred← citeshttps://doi.org/10.1145/2676726.2676965openalex-snapshot
Equations, Contractions, and Unique Solutions
inferred← citeshttps://doi.org/10.1145/2775051.2676965openalex-snapshot
Equations, Contractions, and Unique Solutions
inferred← citeshttps://doi.org/10.1145/2873052openalex-snapshot
Foundations of Session Types and Behavioural Contracts
inferred← citeshttps://doi.org/10.1145/2971339openalex-snapshot
Equations, Contractions, and Unique Solutions
inferred← citeshttps://doi.org/10.1145/3158144openalex-snapshot
Verifying equivalence of database-driven applications
inferred← citeshttps://doi.org/10.1145/340855.340876openalex-snapshot
Specification formalisms for component-based concurrent systems
inferred← citeshttps://doi.org/10.1145/3498679openalex-snapshot
From enhanced coinduction towards enhanced induction
inferred← citeshttps://doi.org/10.1145/587051.587077openalex-snapshot
Triggered message sequence charts
inferred← citeshttps://doi.org/10.14236/ewic/vecos2008.1openalex-snapshot
Aggregation of Transitions in Marking Graph Generation Based on Maximality Semantics for Petri Nets
inferred← citeshttps://doi.org/10.15546/aeei-2014-0012openalex-snapshot
Security Properties Verification of Security Protocols
inferred← citeshttps://doi.org/10.2168/lmcs-9(2:11)2013openalex-snapshot
Unifying the Linear Time-Branching Time Spectrum of Process Semantics
inferred← citeshttps://doi.org/10.3233/fun-2002-52402openalex-snapshot
Comparing Refinements for Failure and Bisimulation Semantics
inferred← citeshttps://doi.org/10.4230/dagsemproc.04371.3openalex-snapshot
Online Testing of Real-Time Systems Using UPPAAL: Status and Future Work
inferred← citeshttps://doi.org/10.4230/lipics.concur.2017.8openalex-snapshot
Consistently-Detecting Monitors
inferred← citeshttps://doi.org/10.46298/lmcs-18(3:19)2022openalex-snapshot
Deciding All Behavioral Equivalences at Once: A Game for Linear-Time--Branching-Time Spectroscopy
inferred← citeshttps://doi.org/10.48550/arxiv.1003.1160openalex-snapshot
Required Behavior of Sequence Diagrams: Semantics and Conformance
inferred← citeshttps://doi.org/10.5281/zenodo.196092openalex-snapshot
FIGURES 25–32 in The genus Scrobipalpa Janse (Lepidoptera, Gelechiidae) in China, with descriptions of 13 new species
inferred← citeshttps://doi.org/10.70675/87f7c663za016z4bbcz8da3z48ba68638bb9openalex-snapshot
Développement incrémental de spécifications d'architectures en UML intégrant des procédures de vérification
inferred← citeshttps://doi.org/10.7146/brics.v3i39.20021openalex-snapshot
On the Complexity of Deciding Behavioural Equivalences and Preorders. A Survey
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.