On the public citation graph
Petri nets and the equivalence problem
0 signed · 71 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.1007/3-540-17945-3_5openalex-snapshot
Decidability of bisimulation equivalence for processes generating context-free languages
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-57208-2_6openalex-snapshot
The linear time — Branching time spectrum II
inferredcites →https://doi.org/10.1007/3-540-57785-8_173openalex-snapshot
Decidability questions for bisimilarity of Petri nets and some related problems
inferredcites →https://doi.org/10.1007/3-540-57887-0_110openalex-snapshot
Undecidable equivalences for basic parallel processes
inferredcites →https://doi.org/10.1016/0304-3975(76)90008-6openalex-snapshot
The equality problem for vector addition systems is undecidable
inferredcites →https://doi.org/10.1109/lics.1993.287569openalex-snapshot
Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes
inferredcites →https://doi.org/10.1137/0213029openalex-snapshot
An Algorithm for the General Petri Net Reachability Problem
inferredcites →https://doi.org/10.1145/174130.174141openalex-snapshot
Decidability of bisimulation equivalence for process generating context-free languages
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
inferredcites →https://doi.org/10.1145/800070.802201openalex-snapshot
Decidability of reachability in vector addition systems (Preliminary Version)
inferredcites →https://doi.org/10.2307/2313471openalex-snapshot
Computation: Finite and Infinite 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.1999.2813openalex-snapshot
Decidability of Bisimilarity for One-Counter Processes
inferred← citeshttps://doi.org/10.1006/jcss.1999.1643openalex-snapshot
Petri Nets and Regular Processes
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-45694-5_37openalex-snapshot
Decidability of Strong Bisimilarity for Timed BPP
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_173openalex-snapshot
Decidability questions for bisimilarity of Petri nets and some related problems
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_110openalex-snapshot
Undecidable equivalences for basic parallel processes
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_206openalex-snapshot
High undecidability of weak bisimilarity for Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_62openalex-snapshot
On the model checking problem for branching time logics and basic parallel processes
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_26openalex-snapshot
Checking regular properties of Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_54openalex-snapshot
Petri nets, commutative context-free grammars, and basic parallel processes
inferred← citeshttps://doi.org/10.1007/3-540-60915-6_4openalex-snapshot
Decidability results in automata and process theory
inferred← citeshttps://doi.org/10.1007/3-540-61363-3_25openalex-snapshot
Behavioural equivalence for infinite systems — Partially decidable!
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_152openalex-snapshot
Deciding finiteness of Petri nets up to bisimulation
inferred← citeshttps://doi.org/10.1007/3-540-62034-6_40openalex-snapshot
Weak bisimulation and model checking for Basic Parallel Processes
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_210openalex-snapshot
Bisimulation equivalence is decidable for one-counter processes
inferred← citeshttps://doi.org/10.1007/978-3-031-33620-1_18openalex-snapshot
Automated Polyhedral Abstraction Proving
inferred← citeshttps://doi.org/10.1007/978-3-032-17618-9_35openalex-snapshot
Automated Conformance Checking Between Process Models and Their Generalized Reference Process Models
inferred← citeshttps://doi.org/10.1007/978-3-319-23506-6_8openalex-snapshot
Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_46openalex-snapshot
A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_64openalex-snapshot
Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the π-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-00596-1_18openalex-snapshot
On the Expressive Power of Restriction and Priorities in CCS with Replication
inferred← citeshttps://doi.org/10.1007/978-3-642-04840-1_6openalex-snapshot
A Generic Set Theory-Based Pattern Matching Approach for the Analysis of Conceptual Models
inferred← citeshttps://doi.org/10.1007/978-3-642-45100-3_9openalex-snapshot
Semantic Business Process Modelling and Analysis
inferred← citeshttps://doi.org/10.1007/978-3-662-43376-8_1openalex-snapshot
Encoding Synchronous Interactions Using Labelled Petri Nets
inferred← citeshttps://doi.org/10.1007/bfb0015435openalex-snapshot
Deciding bisimulation and trace equivalences for systems with many identical processes
inferred← citeshttps://doi.org/10.1007/s002360050074openalex-snapshot
Decidability of model checking for infinite-state concurrent systems
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00037-wopenalex-snapshot
Undecidability of bisimilarity for Petri nets and some related problems
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50027-8openalex-snapshot
Verification on Infinite Structures
inferred← citeshttps://doi.org/10.1016/j.ic.2004.06.003openalex-snapshot
On the computational complexity of bisimulation, redux
inferred← citeshttps://doi.org/10.1016/j.ic.2008.12.011openalex-snapshot
Undecidable equivalences for basic parallel processes
inferred← citeshttps://doi.org/10.1016/j.scico.2014.11.019openalex-snapshot
Modular encoding of synchronous and asynchronous interactions using open Petri nets
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00099-2openalex-snapshot
Pushdown automata, multiset automata, and Petri nets
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00147-8openalex-snapshot
On reachability equivalence for BPP-nets
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)80714-6openalex-snapshot
Deciding bisimulation and trace equivalences for systems with many identical processes
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80246-4openalex-snapshot
A Taxonomy of Infinite State Processes
inferred← citeshttps://doi.org/10.1017/cbo9780511792588.004openalex-snapshot
The algorithmics of bisimilarity
inferred← citeshttps://doi.org/10.1017/s0960129500000992openalex-snapshot
A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
inferred← citeshttps://doi.org/10.1017/s1471068406002651openalex-snapshot
Equivalence-checking on infinite-state systems: Techniques and results
inferred← citeshttps://doi.org/10.1108/14637151111166187openalex-snapshot
Automatic identification of structural process weaknesses in flow chart diagrams
inferred← citeshttps://doi.org/10.1109/access.2019.2933247openalex-snapshot
Behavior Analysis for Electronic Commerce Trading Systems: A Survey
inferred← citeshttps://doi.org/10.1109/tsmc.2015.2426147openalex-snapshot
The Reversible Released Form of Petri Nets and Its Applications to Soundness of Workflow Nets
inferred← citeshttps://doi.org/10.1109/tsmca.2007.909559openalex-snapshot
Designs of Bisimilar Petri Net Controllers With Fault Tolerance Capabilities
inferred← citeshttps://doi.org/10.1145/3436980.3436984openalex-snapshot
The ABCs of petri net reachability relaxations
inferred← citeshttps://doi.org/10.1145/778348.778357openalex-snapshot
On the computational complexity of bisimulation, redux
inferred← citeshttps://doi.org/10.3233/fi-1996-2617openalex-snapshot
UNDECIDABILITY OF LANGUAGE EQUIVALENCE FOR GENERALIZED REGULAR EXPRESSIONS
inferred← citeshttps://doi.org/10.3233/fi-1997-3112openalex-snapshot
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes
inferred← citeshttps://doi.org/10.3233/fi-2015-1170openalex-snapshot
Complexity Results for Problems of Communication-Free Petri Nets and Related Formalisms
inferred← citeshttps://doi.org/10.3233/jcs-160549openalex-snapshot
Model-checking trace-based information flow properties for infinite-state systems
inferred← citeshttps://doi.org/10.4018/978-1-60960-126-3.ch007openalex-snapshot
Supporting Conceptual Model Analysis Using Semantic Standardization and Structural Pattern Matching
inferred← citeshttps://doi.org/10.4204/eptcs.89.8openalex-snapshot
Approximating Weak Bisimilarity of Basic Parallel Processes
inferred← citeshttps://doi.org/10.48550/arxiv.1909.01421openalex-snapshot
Mining Insights from Weakly-Structured Event Data
inferred← citeshttps://doi.org/10.7146/brics.v1i8.21662openalex-snapshot
Decidability Issues for Petri Nets
inferred← citeshttps://doi.org/10.7146/brics.v2i55.19956openalex-snapshot
Behavioural Equivalence for Infinite Systems—Partially Decidable!
inferred← citeshttps://doi.org/10.7146/brics.v5i6.19278openalex-snapshot
Further Results on Partial Order Equivalences on Infinite 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.