On the public citation graph
Simulation is decidable for one-counter nets
0 signed · 55 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1994.1101openalex-snapshot
Undecidable Equivalences for Basic Process Algebra
inferredcites →https://doi.org/10.1006/inco.1996.0053openalex-snapshot
Verifying Programs with Unreliable Channels
inferredcites →https://doi.org/10.1007/3-540-57208-2_11openalex-snapshot
Bisimulation equivalence is decidable for basic parallel processes
inferredcites →https://doi.org/10.1007/3-540-59042-0_57openalex-snapshot
On the synthesis of strategies in infinite games
inferredcites →https://doi.org/10.1007/3-540-60218-6_1openalex-snapshot
Local model checking games (extended abstract)
inferredcites →https://doi.org/10.1007/3-540-60218-6_26openalex-snapshot
Checking regular properties of Petri nets
inferredcites →https://doi.org/10.1007/3-540-60249-6_54openalex-snapshot
Petri nets, commutative context-free grammars, and basic parallel processes
inferredcites →https://doi.org/10.1007/3-540-61440-0_152openalex-snapshot
Deciding finiteness of Petri nets up to bisimulation
inferredcites →https://doi.org/10.1007/3-540-61604-7_57openalex-snapshot
Decidability of bisimulation equivalence for normed pushdown processes
inferredcites →https://doi.org/10.1007/3-540-63165-8_210openalex-snapshot
Bisimulation equivalence is decidable for one-counter processes
inferredcites →https://doi.org/10.1007/bfb0084788openalex-snapshot
Bisimulation equivalence is decidable for all context-free processes
inferredcites →https://doi.org/10.1016/0304-3975(95)00037-wopenalex-snapshot
Undecidability of bisimilarity for Petri nets and some related problems
inferredcites →https://doi.org/10.1016/s0304-3975(97)00216-8openalex-snapshot
Decidability of bisimulation equivalence for normed pushdown processes
inferredcites →https://doi.org/10.1109/lics.1993.287591openalex-snapshot
Verifying programs with unreliable channels
inferredcites →https://doi.org/10.1145/174130.174141openalex-snapshot
Decidability of bisimulation equivalence for process generating context-free languages
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.1999.2813openalex-snapshot
Decidability of Bisimilarity for One-Counter Processes
inferred← citeshttps://doi.org/10.1006/inco.2001.3122openalex-snapshot
Simulation Preorder over Simple Process Algebras
inferred← citeshttps://doi.org/10.1007/3-540-36137-5_3openalex-snapshot
Equivalence-Checking with Infinite-State Systems: Techniques and Results
inferred← citeshttps://doi.org/10.1007/3-540-44464-5_11openalex-snapshot
On Simulation-Checking with Sequential Systems
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_28openalex-snapshot
Efficient Verification Algorithms for One-Counter Processes
inferred← citeshttps://doi.org/10.1007/3-540-45740-2_3openalex-snapshot
Towards a Notion of Distributed Time for Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-45931-6_13openalex-snapshot
Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds*
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_28openalex-snapshot
Simulation and Bisimulation over One-Counter Processes
inferred← citeshttps://doi.org/10.1007/3-540-47849-3_28openalex-snapshot
Simulation Problems for One-Counter Machine
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_47openalex-snapshot
Simulation Preorder on Simple Process Algebras
inferred← citeshttps://doi.org/10.1007/978-3-030-00250-3_5openalex-snapshot
EXPSPACE-Complete Variant of Countdown Games, and Simulation on Succinct One-Counter Nets
inferred← citeshttps://doi.org/10.1007/978-3-030-62822-2_6openalex-snapshot
Computing Linear Arithmetic Representation of Reachability Relation of One-Counter Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-11439-2_12openalex-snapshot
Trace Inclusion for One-Counter Nets Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-24537-9_5openalex-snapshot
Reachability in Succinct One-Counter Games
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_25openalex-snapshot
Reachability in Succinct and Parametric One-Counter Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-14162-1_40openalex-snapshot
Reachability Games on Extended Vector Addition Systems with States
inferred← citeshttps://doi.org/10.1007/978-3-662-44584-6_35openalex-snapshot
Verification for Timed Automata Extended with Unbounded Discrete Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-662-45391-9_46openalex-snapshot
Decidability and Complexity of Simulation Preorder for Data-Centric Web Services
inferred← citeshttps://doi.org/10.1007/978-3-662-45730-6_1openalex-snapshot
Decidability of $$k$$-Soundness for Workflow Nets with an Unbounded Resource
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50027-8openalex-snapshot
Verification on Infinite Structures
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.09.004openalex-snapshot
A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.05.009openalex-snapshot
Trace inclusion for one-counter nets revisited
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00081-1openalex-snapshot
The complexity of bisimilarity-checking for one-counter processes
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00171-8openalex-snapshot
DP lower bounds for equivalence-checking and model-checking of one-counter automata
inferred← citeshttps://doi.org/10.1017/s1471068406002651openalex-snapshot
Equivalence-checking on infinite-state systems: Techniques and results
inferred← citeshttps://doi.org/10.1109/lics.2013.26openalex-snapshot
Decidability of Weak Simulation on One-Counter Nets
inferred← citeshttps://doi.org/10.1142/s0218843016500088openalex-snapshot
Decidability and Complexity of Web Service Business Protocol Synthesis
inferred← citeshttps://doi.org/10.18255/1818-1015-2013-2-139-156openalex-snapshot
On the Efficient Representation of an Unbounded Resource with the Aid of One-Counter Circuits
inferred← citeshttps://doi.org/10.18255/1818-1015-2013-4-23-40openalex-snapshot
On the Decidability of Soundness of Workflow Nets with an Unbounded Resource
inferred← citeshttps://doi.org/10.2168/lmcs-12(1:6)2016openalex-snapshot
Simulation Problems Over One-Counter Nets
inferred← citeshttps://doi.org/10.3103/s014641161207005xopenalex-snapshot
Approximating bisimulation in one-counter nets
inferred← citeshttps://doi.org/10.3103/s0146411614070189openalex-snapshot
On the efficient modeling of unbounded resource by one-counter circuits
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2013.515openalex-snapshot
Simulation Over One-counter Nets is PSPACE-Complete
inferred← citeshttps://doi.org/10.46298/lmcs-19(1:11)2023openalex-snapshot
Countdown games, and simulation on (succinct) one-counter nets
inferred← citeshttps://doi.org/10.48550/arxiv.1002.2557openalex-snapshot
Reachability Games on Extended Vector Addition Systems with States
inferred← citeshttps://doi.org/10.48550/arxiv.1304.4104openalex-snapshot
Decidability of Weak Simulation on One-counter Nets
inferred← citeshttps://doi.org/10.48550/arxiv.1404.5157openalex-snapshot
Trace Inclusion for One-Counter Nets Revisited
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0505025openalex-snapshot
Equivalence-Checking on Infinite-State Systems: Techniques and Results
inferred← citeshttps://doi.org/10.70675/14e59d94zb71fz45bcza6e5z955fda663e42openalex-snapshot
Decidability and complexity of simulation preorder for data-centric Web services
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.