On the public citation graph

Reaching and Distinguishing States of Distributed Systems

0 signed · 53 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/978-0-387-35062-2_10openalex-snapshot
Testing deterministic implementations from nondeterministic FSM specifications
inferredcites →https://doi.org/10.1007/978-3-540-24617-6_18openalex-snapshot
Towards a Tool Environment for Model-Based Testing with AsmL
inferredcites →https://doi.org/10.1007/978-3-540-73066-8_12openalex-snapshot
Testing Input/Output Partial Order Automata
inferredcites →https://doi.org/10.1016/0020-0190(91)90166-fopenalex-snapshot
The synchronization problem in protocol testing and its complexity
inferredcites →https://doi.org/10.1016/0022-0000(84)90034-5openalex-snapshot
The complexity of two-player games of incomplete information
inferredcites →https://doi.org/10.1016/j.tcs.2009.09.039openalex-snapshot
Canonical finite state machines for distributed systems
inferredcites →https://doi.org/10.1016/s0169-7552(98)00013-0openalex-snapshot
Synchronizable test sequences of finite state machines
inferredcites →https://doi.org/10.1016/s0898-1221(00)00333-3openalex-snapshot
Lower bounds for multiplayer noncooperative games of incomplete information
inferredcites →https://doi.org/10.1016/s0898-1221(01)00282-6openalex-snapshot
Decision algorithms for multiplayer noncooperative games of incomplete information
inferredcites →https://doi.org/10.1016/s0950-5849(03)00060-0openalex-snapshot
UIO sequence based checking sequences for distributed test architectures
inferredcites →https://doi.org/10.1016/s0950-5849(99)00036-1openalex-snapshot
Controllability and observability in distributed testing
inferredcites →https://doi.org/10.1049/sej.1993.0024openalex-snapshot
A test generation algorithm for systems modelled as non-deterministic FSMs
inferredcites →https://doi.org/10.1093/comjnl/bxm096openalex-snapshot
The Effect of the Distributed Test Architecture on the Power of Testing
inferredcites →https://doi.org/10.1109/26.111442openalex-snapshot
An optimization technique for protocol conformance test generation based on UIO sequences and rural Chinese postman tours
inferredcites →https://doi.org/10.1109/32.265636openalex-snapshot
Test selection based on communicating nondeterministic finite-state machines using a generalized Wp-method
inferredcites →https://doi.org/10.1109/5.533956openalex-snapshot
Principles and methods of testing finite state machines-a survey
inferredcites →https://doi.org/10.1109/90.374116openalex-snapshot
Synchronizable test sequences based on multiple UIO sequences
inferredcites →https://doi.org/10.1109/ccc.2008.35openalex-snapshot
Constraint Logic: A Uniform Framework for Modeling Computation as Games
inferredcites →https://doi.org/10.1109/sfcs.1979.25openalex-snapshot
Multiple-person alternation
inferredcites →https://doi.org/10.1109/swct.1964.8openalex-snapshot
Fault detecting experiments for sequential circuits
inferredcites →https://doi.org/10.1109/t-c.1970.222975openalex-snapshot
A Method for the Design of Fault Detection Experiments
inferredcites →https://doi.org/10.1109/tc.2004.85openalex-snapshot
Testing from a nondeterministic finite state machine using adaptive state counting
inferredcites →https://doi.org/10.1109/tc.2005.152openalex-snapshot
Testing from Partial Deterministic FSM Specifications
inferredcites →https://doi.org/10.1109/tc.2006.80openalex-snapshot
Optimizing the length of checking sequences
inferredcites →https://doi.org/10.1109/tc.2010.238openalex-snapshot
Controllable Testing from Nondeterministic Finite State Machines with Multiple Ports
inferredcites →https://doi.org/10.1109/tcom.1984.1096074openalex-snapshot
Synchronization and Specification Issues in Protocol Testing
inferredcites →https://doi.org/10.1109/tse.1978.231496openalex-snapshot
Testing Software Design Modeled by Finite-State Machines
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1145/225058.225161openalex-snapshot
Distinguishing tests for nondeterministic and probabilistic machines
inferredcites →https://doi.org/10.1145/322234.322243openalex-snapshot
Alternation
inferredcites →https://doi.org/10.1145/566171.566190openalex-snapshot
Generating finite state machines from abstract state machines
inferredcites →https://doi.org/10.1147/sj.411.0089openalex-snapshot
Using a model-based test generator to test for standard conformance
inferredcites →https://doi.org/10.1515/9781400882618-006openalex-snapshot
Gedanken-Experiments on Sequential Machines

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-031-40132-9_3openalex-snapshot
Implementation Relations for Distributed Testing
inferred← citeshttps://doi.org/10.1007/978-3-319-47443-4_6openalex-snapshot
Controllability Through Nondeterminism in Distributed Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-41707-8_6openalex-snapshot
An Implementation Relation and Test Framework for Timed Distributed Systems
inferred← citeshttps://doi.org/10.1016/b978-0-444-53766-9.00015-xopenalex-snapshot
Theory of Combinatorial Games
inferred← citeshttps://doi.org/10.1016/j.csi.2012.01.001openalex-snapshot
New state-recognition patterns for conformance testing of finite state machine implementations
inferred← citeshttps://doi.org/10.1016/j.jss.2013.02.061openalex-snapshot
An orchestrated survey of methodologies for automated software test case generation
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.2012.05.038openalex-snapshot
The complexity of asynchronous model based testing
inferred← citeshttps://doi.org/10.1093/comjnl/bxs107openalex-snapshot
Implementation Relations for Testing Through Asynchronous Channels
inferred← citeshttps://doi.org/10.1093/comjnl/bxw004openalex-snapshot
Distinguishing Sequences for Distributed Testing: Adaptive Distinguishing Sequences
inferred← citeshttps://doi.org/10.1093/comjnl/bxw069openalex-snapshot
Distinguishing Sequences for Distributed Testing: Preset Distinguishing Sequences
inferred← citeshttps://doi.org/10.1109/alife.2011.5954657openalex-snapshot
Creating adaptive sequences with genetic algorithms to reach a certain state in a non-deterministic FSM
inferred← citeshttps://doi.org/10.1109/csci54926.2021.00345openalex-snapshot
Model-Based Testing of Smart Home Systems Using EFSM and CEFSM
inferred← citeshttps://doi.org/10.1109/qrs60937.2023.00046openalex-snapshot
Leveraging Conditional Statement to Generate Acceptance Tests Automatically via Traceable Sequence Generation
inferred← citeshttps://doi.org/10.1109/tc.2012.252openalex-snapshot
Verifying and Comparing Finite State Machines for Systems that Have Distributed Interfaces
inferred← citeshttps://doi.org/10.1109/tr.2018.2800093openalex-snapshot
Bounded Reordering in the Distributed Test Architecture
inferred← citeshttps://doi.org/10.1109/tse.2014.2364035openalex-snapshot
Generating Complete Controllable Test Suites for Distributed Testing
inferred← citeshttps://doi.org/10.1145/2661296openalex-snapshot
Combining Centralised and Distributed Testing
inferred← citeshttps://doi.org/10.48550/arxiv.1108.5295openalex-snapshot
Checking Finite State Machine Conformance when there are Distributed Observations
inferred← citeshttps://doi.org/10.58088/cb3f-fm84openalex-snapshot
Automated techniques for improving the quality of existing test suites
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.