On the public citation graph

Decidability of the termination problem for completely specified protocols

https://doi.org/10.1007/bf02277857
0 signed · 89 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-18088-5_43openalex-snapshot
A generalization of the procedure of karp and miller to well structured transition systems
inferredcites →https://doi.org/10.1007/3-540-50580-6_26openalex-snapshot
A survey on the decidability questions for classes of fifo nets
inferredcites →https://doi.org/10.1007/978-3-540-47919-2openalex-snapshot
Petri Nets: Central Models and Their Properties
inferredcites →https://doi.org/10.1007/bf01667082openalex-snapshot
The construction of self-synchronizing finite state protocols
inferredcites →https://doi.org/10.1007/bf01792729openalex-snapshot
Theorie der endlichen und unendlichen Graphen
inferredcites →https://doi.org/10.1016/0304-3975(86)90110-6openalex-snapshot
Boundedness, empty channel detection, and synchronization for communicating finite automata
inferredcites →https://doi.org/10.1016/0376-5075(78)90015-6openalex-snapshot
Finite state description of communication protocols
inferredcites →https://doi.org/10.1016/0376-5075(82)90029-0openalex-snapshot
An improved protocol validation technique
inferredcites →https://doi.org/10.1016/s0022-0000(69)80011-5openalex-snapshot
Parallel program schemata
inferredcites →https://doi.org/10.1109/tcom.1980.1094687openalex-snapshot
Towards Analyzing and Synthesizing 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.5010246openalex-snapshot
Protocol Verification via Projections
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.1112/plms/s3-2.1.326openalex-snapshot
Ordering by Divisibility in Abstract Algebras
inferredcites →https://doi.org/10.1145/1013812.18198openalex-snapshot
Synthesis of two-party error-recoverable protocols
inferredcites →https://doi.org/10.1145/1024840.1035250openalex-snapshot
Reachability analysis of protocols with FIFO channels
inferredcites →https://doi.org/10.1145/18172.18198openalex-snapshot
Synthesis of two-party error-recoverable protocols
inferredcites →https://doi.org/10.1145/322374.322380openalex-snapshot
On Communicating Finite-State Machines
inferredcites →https://doi.org/10.1145/55482.55496openalex-snapshot
Protocol verification using reachability analysis: the state space explosion problem and relief strategies
inferredcites →https://doi.org/10.1145/55483.55496openalex-snapshot
Protocol verification using reachability analysis: the state space explosion problem and relief strategies
inferredcites →https://doi.org/10.1145/6110.214400openalex-snapshot
A discipline for constructing multiphase communication protocols
inferredcites →https://doi.org/10.5555/27738.27740openalex-snapshot
On deadlock detection in systems of communicating finite state machines

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.1996.0003openalex-snapshot
Unreliable Channels Are Easier to Verify Than Perfect Channels
inferred← citeshttps://doi.org/10.1006/inco.1996.0083openalex-snapshot
Undecidable Verification Problems for Programs with Unreliable Channels
inferred← citeshttps://doi.org/10.1007/11532231_14openalex-snapshot
Temporal Logics over Transitive States
inferred← citeshttps://doi.org/10.1007/11537311_46openalex-snapshot
On the Expressiveness of Asynchronous Cellular Automata
inferred← citeshttps://doi.org/10.1007/11888116_17openalex-snapshot
Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness
inferred← citeshttps://doi.org/10.1007/11916277_24openalex-snapshot
On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems
inferred← citeshttps://doi.org/10.1007/3-540-36576-1_8openalex-snapshot
Model Checking Lossy Channels Systems Is Probably Decidable
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_1openalex-snapshot
Channel Representations in Protocol Verification
inferred← citeshttps://doi.org/10.1007/3-540-45500-0_19openalex-snapshot
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems
inferred← citeshttps://doi.org/10.1007/3-540-45687-2_45openalex-snapshot
On Verifying Fair Lossy Channel Systems
inferred← citeshttps://doi.org/10.1007/3-540-45740-2_5openalex-snapshot
Timed Petri Nets and BQOs
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_16openalex-snapshot
Transitive Closures of Regular Relations for Verifying Infinite-State Systems
inferred← citeshttps://doi.org/10.1007/3-540-48092-7_9openalex-snapshot
On the Existence of Network Invariants for Verifying Parameterized Systems
inferred← citeshttps://doi.org/10.1007/3-540-48778-6_3openalex-snapshot
Establishing Qualitative Properties for Probabilistic Lossy Channel Systems
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_78openalex-snapshot
Undecidable verification problems for programs with unreliable channels
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_25openalex-snapshot
Decidability of simulation and bisimulation between lossy channel systems and finite state systems
inferred← citeshttps://doi.org/10.1007/3-540-63166-6_31openalex-snapshot
Programs with quasi-stable channels are effectively recognizable
inferred← citeshttps://doi.org/10.1007/978-3-319-47846-3_13openalex-snapshot
Towards the Formal Verification of Data-Intensive Applications Through Metric Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-58747-9_18openalex-snapshot
The Transformation Monoid of a Partially Lossy Queue
inferred← citeshttps://doi.org/10.1007/978-3-540-24611-4_13openalex-snapshot
The Verification of Probabilistic Lossy Channel Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-45220-1_1openalex-snapshot
Deciding Monotonic Games
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_22openalex-snapshot
Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_4openalex-snapshot
Stochastic Games with Lossy Channels
inferred← citeshttps://doi.org/10.1007/978-3-540-85257-5_23openalex-snapshot
Calibrating an Embedded Protocol on an Asynchronous System
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_28openalex-snapshot
Mixing Lossy and Perfect Fifo Channels
inferred← citeshttps://doi.org/10.1007/978-3-642-19805-2_11openalex-snapshot
Ordinal Theory for Expressiveness of Well Structured Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-38592-6_15openalex-snapshot
Transducer-Based Algorithmic Verification of Retransmission Protocols over Noisy Channels
inferred← citeshttps://doi.org/10.1007/978-3-642-40184-8_2openalex-snapshot
The Power of Well-Structured Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-40196-1_29openalex-snapshot
Stochastic Parity Games on Lossy Channel Systems
inferred← citeshttps://doi.org/10.1007/bfb0030633openalex-snapshot
Probabilistic lossy channel systems
inferred← citeshttps://doi.org/10.1007/bfb0054314openalex-snapshot
Fundamental structures in Well-Structured infinite Transition Systems
inferred← citeshttps://doi.org/10.1007/s00165-012-0234-7openalex-snapshot
On termination and invariance for faulty channel machines
inferred← citeshttps://doi.org/10.1007/s00165-018-0460-8openalex-snapshot
Parameterized verification of monotone information systems
inferred← citeshttps://doi.org/10.1007/s00236-016-0255-4openalex-snapshot
Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes
inferred← citeshttps://doi.org/10.1007/s10009-012-0231-4openalex-snapshot
Model-checking web services business activity protocols
inferred← citeshttps://doi.org/10.1007/s10009-021-00625-zopenalex-snapshot
What can we monitor over unreliable channels?
inferred← citeshttps://doi.org/10.1007/s10703-012-0168-yopenalex-snapshot
Computable fixpoints in well-structured symbolic model checking
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.05.007openalex-snapshot
A Short Visit to the STS Hierarchy
inferred← citeshttps://doi.org/10.1016/j.ic.2005.05.006openalex-snapshot
Verification of programs with half-duplex communication
inferred← citeshttps://doi.org/10.1016/j.ic.2012.11.003openalex-snapshot
Ordinal theory for expressiveness of well-structured transition systems
inferred← citeshttps://doi.org/10.1016/j.ins.2009.08.029openalex-snapshot
Calibrating embedded protocols on asynchronous systems
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00337-4openalex-snapshot
Verifying lossy channel systems has nonprimitive recursive complexity
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00102-xopenalex-snapshot
Well-structured transition systems everywhere!
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00105-5openalex-snapshot
Ensuring completeness of symbolic verification methods for infinite-state systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00026-6openalex-snapshot
Verifying identical communicating processes is undecidable
inferred← citeshttps://doi.org/10.1051/ita/2018003openalex-snapshot
The inclusion structure of partially lossy queue monoids and their trace submonoids
inferred← citeshttps://doi.org/10.1080/03081079.2012.757437openalex-snapshot
Automated formal analysis and verification: an overview
inferred← citeshttps://doi.org/10.1093/logcom/exm062openalex-snapshot
Monotonic and Downward Closed Games
inferred← citeshttps://doi.org/10.1109/bibe.2007.4375741openalex-snapshot
Storing Efficiently Bioinformatics Workflows
inferred← citeshttps://doi.org/10.1109/lics.2008.47openalex-snapshot
The Ordinal Recursive Complexity of Lossy Channel Systems
inferred← citeshttps://doi.org/10.1142/s0218196722500230openalex-snapshot
Rational, recognizable, and aperiodic partially lossy queue languages
inferred← citeshttps://doi.org/10.1145/1297658.1297663openalex-snapshot
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
inferred← citeshttps://doi.org/10.1145/193173.195292openalex-snapshot
Duplication, insertion and lossiness errors in unreliable communication channels
inferred← citeshttps://doi.org/10.1145/195274.195292openalex-snapshot
Duplication, insertion and lossiness errors in unreliable communication channels
inferred← citeshttps://doi.org/10.1145/2933575.2934535openalex-snapshot
Data Communicating Processes with Unreliable Channels
inferred← citeshttps://doi.org/10.2178/bsl/1294171129openalex-snapshot
Well (and Better) Quasi-Ordered Transition Systems
inferred← citeshttps://doi.org/10.3217/jucs-011-10-1718openalex-snapshot
Probabilistic Models for Reo Connector Circuits
inferred← citeshttps://doi.org/10.4230/lipics.csl.2021.37openalex-snapshot
On Flat Lossy Channel Machines
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2012.224openalex-snapshot
Safety Verification of Communicating One-Counter Machines
inferred← citeshttps://doi.org/10.46298/lmcs-18(1:19)2022openalex-snapshot
Bounded Reachability Problems are Decidable in FIFO Machines
inferred← citeshttps://doi.org/10.48550/arxiv.0802.2839openalex-snapshot
On Termination for Faulty Channel Machines
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0409052openalex-snapshot
Better Quasi-Ordered Transition Systems
inferred← citeshttps://doi.org/10.70675/61130ea1zef23z4950z81e1z91b74939ff7copenalex-snapshot
Vers la vérification de propriétés de sûreté pour des systèmes infinis communicants : décidabilité et raffinement des abstractions
inferred← citeshttps://doi.org/10.70675/6c9d51cbze0efz4fdezb9b8z4ddc2f8fce0fopenalex-snapshot
Subwords : automata, embedding problems, and verification
inferred← citeshttps://doi.org/10.70675/aaf5ababzf26dz49d5zb693z1b5e47ced775openalex-snapshot
Formal Verification of Communicating Automata
inferred← citeshttps://doi.org/10.70675/ac4131abz125bz48a0zb249z94e706479cddopenalex-snapshot
On Post’s embedding problem and the complexity of lossy channels
inferred← citeshttps://doi.org/10.70675/bc491e0czbb66z4068zb389z2dd217d423caopenalex-snapshot
Synchronizing sequences for unbounded synchronized Petri nets
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.