On the public citation graph
Petri Nets and Regular Processes
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.1007/3-540-57208-2_6openalex-snapshot
The linear time — Branching time spectrum II
inferredcites →https://doi.org/10.1007/3-540-57887-0_110openalex-snapshot
Undecidable equivalences for basic parallel processes
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-61440-0_152openalex-snapshot
Deciding finiteness of Petri nets up to bisimulation
inferredcites →https://doi.org/10.1007/bfb0039066openalex-snapshot
The linear time - branching time spectrum
inferredcites →https://doi.org/10.1007/bfb0049331openalex-snapshot
Petri nets and the equivalence problem
inferredcites →https://doi.org/10.1016/0022-0000(81)90067-2openalex-snapshot
Petri nets and regular languages
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0167-6423(90)90076-popenalex-snapshot
Communication and concurrency
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.1016/0304-3975(90)90006-4openalex-snapshot
Decidability of a temporal logic problem for Petri nets
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/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/0378-4754(82)90066-0openalex-snapshot
Petri Net theory and the modeling of systems
inferredcites →https://doi.org/10.1016/j.ic.2008.12.011openalex-snapshot
Undecidable equivalences for basic parallel processes
inferredcites →https://doi.org/10.1016/s0304-3975(00)00027-xopenalex-snapshot
Deciding bisimulation-like equivalences with finite-state processes
inferredcites →https://doi.org/10.1016/s0304-3975(00)00100-6openalex-snapshot
Nonprimitive recursive complexity and undecidability for Petri net equivalences
inferredcites →https://doi.org/10.1016/s1571-0661(05)80428-1openalex-snapshot
Bisimilarity of processes with finite-state systems
inferredcites →https://doi.org/10.1112/plms/s3-2.1.326openalex-snapshot
Ordering by Divisibility in Abstract Algebras
inferredcites →https://doi.org/10.1137/0213029openalex-snapshot
An Algorithm for the General Petri Net Reachability Problem
inferredcites →https://doi.org/10.2307/2313471openalex-snapshot
Computation: Finite and Infinite Machines.
inferredcites →https://doi.org/10.2307/2370405openalex-snapshot
Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470611647.ch12openalex-snapshot
Verification of Specific Properties
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_5openalex-snapshot
Techniques for Decidability and Undecidability of Bisimilarity
inferred← citeshttps://doi.org/10.1007/978-3-030-32304-2_8openalex-snapshot
Language Inclusion Algorithms as Complete Abstract Interpretations
inferred← citeshttps://doi.org/10.1007/978-3-031-56222-8_9openalex-snapshot
A Uniform Framework for Language Inclusion Problems
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-642-15375-4_13openalex-snapshot
Bisimilarity of One-Counter Processes Is PSPACE-Complete
inferred← citeshttps://doi.org/10.1007/978-3-642-40184-8_9openalex-snapshot
Solving Parity Games on Integer Vectors
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/s10703-012-0168-yopenalex-snapshot
Computable fixpoints in well-structured symbolic model checking
inferred← citeshttps://doi.org/10.1007/s10703-017-0285-8openalex-snapshot
Automated verification of automata communicating via FIFO and bag buffers
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50027-8openalex-snapshot
Verification on Infinite Structures
inferred← citeshttps://doi.org/10.1016/j.ic.2009.01.003openalex-snapshot
Reachability is decidable for weakly extended process rewrite systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.09.021openalex-snapshot
On the coverability and reachability languages of monotonic extensions of Petri nets
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/j.tcs.2017.10.011openalex-snapshot
Verifying chemical reaction network implementations: A pathway decomposition approach
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.01.005openalex-snapshot
Interleaving isotactics – An equivalence notion on behaviour abstractions
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/s1571-0661(05)80246-4openalex-snapshot
A Taxonomy of Infinite State Processes
inferred← citeshttps://doi.org/10.1109/ecbs.2008.12openalex-snapshot
Intuitive Mapping of UML 2 Activity Diagrams into Fundamental Modeling Concept Petri Net Diagrams and Colored Petri Nets
inferred← citeshttps://doi.org/10.1109/lics.2013.26openalex-snapshot
Decidability of Weak Simulation on One-Counter Nets
inferred← citeshttps://doi.org/10.1109/lics.2013.9openalex-snapshot
On the Context-Freeness Problem for Vector Addition Systems
inferred← citeshttps://doi.org/10.1109/tac.2006.875026openalex-snapshot
On Minimal Representations of Petri Net Languages
inferred← citeshttps://doi.org/10.1109/wodes.2002.1167694openalex-snapshot
On minimal representations of Petri net languages
inferred← citeshttps://doi.org/10.1145/3462673openalex-snapshot
Complete Abstractions for Checking Language Inclusion
inferred← citeshttps://doi.org/10.2168/lmcs-11(3:20)2015openalex-snapshot
Verification for Timed Automata extended with Unbounded Discrete Data Structures
inferred← citeshttps://doi.org/10.4230/lipics.concur.2020.47openalex-snapshot
Parametrized Universality Problems for One-Counter Nets
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2017.49openalex-snapshot
On the Upward/Downward Closures of Petri Nets
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.2008.08828openalex-snapshot
On the Use of Quasiorders in Formal Language Theory
inferred← citeshttps://doi.org/10.4995/thesis/10251/4562openalex-snapshot
Representación, interpretación y aprendizaje de flujos de trabajo basado en actividades para la estandarización de vías clínicas.
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.