On the public citation graph

Proving liveness for networks of communicating finite state machines

0 signed · 61 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.1016/0376-5075(78)90015-6openalex-snapshot
Finite state description of communication protocols
inferredcites →https://doi.org/10.1016/c2013-0-06780-1openalex-snapshot
Technical Aspects of Data Communication
inferredcites →https://doi.org/10.1016/s0019-9958(84)80014-5openalex-snapshot
On the progress of communication between two finite state machines
inferredcites →https://doi.org/10.1109/sfcs.1977.32openalex-snapshot
The temporal logic of programs
inferredcites →https://doi.org/10.1109/tcom.1980.1094685openalex-snapshot
Formal Methods in Communication Protocol Design
inferredcites →https://doi.org/10.1109/tcom.1980.1094687openalex-snapshot
Towards Analyzing and Synthesizing Protocols
inferredcites →https://doi.org/10.1109/tcom.1982.1095450openalex-snapshot
Deadlock Detection for a Class of Communicating Finite State Machines
inferredcites →https://doi.org/10.1109/tcom.1983.1095720openalex-snapshot
Modular Verification of Computer Communication Protocols
inferredcites →https://doi.org/10.1109/tcom.1984.1096134openalex-snapshot
Synthesis of Communicating Finite-State Machines with Guaranteed Progress
inferredcites →https://doi.org/10.1109/tse.1984.5010313openalex-snapshot
Closed Covers: To Verify Progress for Communicating Finite State Machines
inferredcites →https://doi.org/10.1145/322374.322380openalex-snapshot
On Communicating Finite-State Machines
inferredcites →https://doi.org/10.1145/357172.357178openalex-snapshot
Proving Liveness Properties of Concurrent Programs
inferredcites →https://doi.org/10.1145/357980.358015openalex-snapshot
Ethernet
inferredcites →https://doi.org/10.1145/360248.360253openalex-snapshot
Ethernet
inferredcites →https://doi.org/10.1145/362946.362970openalex-snapshot
A note on reliable full-duplex transmission over half-duplex links
inferredcites →https://doi.org/10.1145/567067.567082openalex-snapshot
How to cook a temporal proof system for your pet language
inferredcites →https://doi.org/10.1145/800061.808757openalex-snapshot
On the extremely fair treatment of probabilistic algorithms
inferredcites →https://doi.org/10.1145/800220.806698openalex-snapshot
Proving safety and liveness of communicating processes with examples
inferredcites →https://doi.org/10.1145/800222.806734openalex-snapshot
A technique for proving liveness of communicating finite state machines with examples

What points at this work

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

inferred← citeshttps://doi.org/10.1002/spe.4380240805openalex-snapshot
An interactive tool for design, simulation, verification, and synthesis of protocols
inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_10openalex-snapshot
Agent Based Modeling, Mathematical Formalism for
inferred← citeshttps://doi.org/10.1007/978-1-0716-0368-0_10openalex-snapshot
Agent-Based Modeling, Mathematical Formalism for
inferred← citeshttps://doi.org/10.1007/978-1-4614-1800-9_6openalex-snapshot
Agent Based Modeling, Mathematical Formalism for
inferred← citeshttps://doi.org/10.1007/978-3-030-61362-4_3openalex-snapshot
Composing Communicating Systems, Synchronously
inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_10-5openalex-snapshot
Agent-Based Modeling, Mathematical Formalism for
inferred← citeshttps://doi.org/10.1007/bf02090765openalex-snapshot
Communicating processes, scheduling, and the complexity of nontermination
inferred← citeshttps://doi.org/10.1007/bfb0023740openalex-snapshot
The algebraic feedback product of automata
inferred← citeshttps://doi.org/10.1016/0066-4138(90)90015-jopenalex-snapshot
Construction of logically correct communication protocols without over-specification
inferred← citeshttps://doi.org/10.1016/0164-1212(89)90046-0openalex-snapshot
Finding reachable states of finite-state concurrent systems
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90206-hopenalex-snapshot
Global and local views of state fairness
inferred← citeshttps://doi.org/10.1016/0920-5489(88)90095-5openalex-snapshot
Protocol specification, testing, and verification, IV
inferred← citeshttps://doi.org/10.1016/j.ins.2011.11.034openalex-snapshot
An enhanced flow analysis technique for detecting unreachability faults in concurrent systems
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.03.006openalex-snapshot
Complexity of reachability problems for finite discrete dynamical systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.04.026openalex-snapshot
Predecessor existence problems for finite discrete dynamical systems
inferred← citeshttps://doi.org/10.1016/s0140-3664(03)00095-1openalex-snapshot
Verifying liveness properties of multifunction composite protocols
inferred← citeshttps://doi.org/10.1016/s0140-3664(96)01152-8openalex-snapshot
An approach to cyclic protocol validation
inferred← citeshttps://doi.org/10.1016/s0140-3664(97)80190-9openalex-snapshot
A modular methodology to verify communication protocols
inferred← citeshttps://doi.org/10.1016/s0140-3664(97)84932-8openalex-snapshot
Reachability and reverse reachability analysis of CFSMs
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00395-xopenalex-snapshot
Reachability problems for sequential dynamical systems with threshold functions
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)53686-1openalex-snapshot
Construction of Logically Correct Communication Protocols without Over-Specification
inferred← citeshttps://doi.org/10.1023/a:1013640918785openalex-snapshot
Deadlock detection in communicating finite state machines by even reachability analysis
inferred← citeshttps://doi.org/10.1109/32.41341openalex-snapshot
On conditions for defining a closed cover to verify progress for communicating finite state machines
inferred← citeshttps://doi.org/10.1109/32.4653openalex-snapshot
PROSPEC: an interactive programming environment for designing and verifying communication protocols
inferred← citeshttps://doi.org/10.1109/32.99197openalex-snapshot
Temporal logic-based deadlock analysis for Ada
inferred← citeshttps://doi.org/10.1109/icccn.1995.540099openalex-snapshot
Reachability problems for cyclic protocols
inferred← citeshttps://doi.org/10.1109/icccn.1995.540102openalex-snapshot
On reachability and reverse reachability analysis of communicating finite state machines
inferred← citeshttps://doi.org/10.1109/icccn.1995.540187openalex-snapshot
Deadlock detection in communicating finite state machines by even reachability analysis
inferred← citeshttps://doi.org/10.1109/icnp.1998.723742openalex-snapshot
A proof technique for liveness properties of multifunction composite protocols
inferred← citeshttps://doi.org/10.1109/infcom.1988.12975openalex-snapshot
Formal specification and analysis of DMI-an X-25 based protocol
inferred← citeshttps://doi.org/10.1142/s0129054106004339openalex-snapshot
ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS
inferred← citeshttps://doi.org/10.1145/122419.122425openalex-snapshot
Experience with formal methods in protocol development
inferred← citeshttps://doi.org/10.1145/55482.55497openalex-snapshot
New communication protocols from old
inferred← citeshttps://doi.org/10.1145/55483.55497openalex-snapshot
New communication protocols from old
inferred← citeshttps://doi.org/10.1145/800222.806734openalex-snapshot
A technique for proving liveness of communicating finite state machines with examples
inferred← citeshttps://doi.org/10.11606/t.3.2006.tde-04052006-155552openalex-snapshot
Análise lógica de protocolos, proposta e avaliação de desempenho de um algoritmo de atribuição de rótulo baseado em SRLG em um ambiente GMPLS-WDM.
inferred← citeshttps://doi.org/10.25439/rmt.27351228openalex-snapshot
Dynamic communication across supply chain services
inferred← citeshttps://doi.org/10.37099/mtu.dc.etds/178openalex-snapshot
Automated design of self-stabilization
inferred← citeshttps://doi.org/10.46298/dmtcs.2294openalex-snapshot
Gardens of Eden and Fixed Points in Sequential Dynamical Systems
inferred← citeshttps://doi.org/10.46298/dmtcs.2314openalex-snapshot
Predecessor and Permutation Existence Problems for Sequential Dynamical Systems.
inferred← citeshttps://doi.org/10.48550/arxiv.0801.0249openalex-snapshot
A mathematical formalism for agent-based modeling
inferred← citeshttps://doi.org/10.5555/3091125.3091195openalex-snapshot
Phase Transitions in Possible Dynamics of Cellular and Graph Automata Models of Sparsely Interconnected Multi-Agent Systems
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.