On the public citation graph

Combining Petri nets and PA-processes

https://doi.org/10.1007/bfb0014567
0 signed · 28 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-60045-0_62openalex-snapshot
On the model checking problem for branching time logics and basic parallel processes
inferredcites →https://doi.org/10.1007/3-540-61604-7_71openalex-snapshot
Constrained properties, semilinear systems, and Petri nets
inferredcites →https://doi.org/10.1007/3-540-62034-6_40openalex-snapshot
Weak bisimulation and model checking for Basic Parallel Processes
inferredcites →https://doi.org/10.1007/3-540-62034-6_42openalex-snapshot
Regularity is decidable for normed PA processes in polynomial time
inferredcites →https://doi.org/10.1007/3-540-63141-0_23openalex-snapshot
Model checking PA-processes
inferredcites →https://doi.org/10.1007/978-3-540-48654-1_9openalex-snapshot
Pushdown Processes: Parallel Composition and Model Checking
inferredcites →https://doi.org/10.1007/bfb0027420openalex-snapshot
Tableau methods for PA-processes
inferredcites →https://doi.org/10.1007/s002360050074openalex-snapshot
Decidability of model checking for infinite-state concurrent systems
inferredcites →https://doi.org/10.1137/0213029openalex-snapshot
An Algorithm for the General Petri Net Reachability Problem
inferredcites →https://doi.org/10.1145/199448.199470openalex-snapshot
Verifying infinite state processes with sequential and parallel composition

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118602638.ch8openalex-snapshot
Verification of Infinite‐State Systems
inferred← citeshttps://doi.org/10.1007/978-1-4615-4493-7_48openalex-snapshot
Modelling and Analyzing Systems with Recursive Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-031-84617-5_18openalex-snapshot
Workflow Net Compositions for the Analysis of Service-Oriented Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-72125-5_20openalex-snapshot
Deadlock Analysis of Service-Oriented Systems with Recursion and Concurrency
inferred← citeshttps://doi.org/10.1007/bfb0055615openalex-snapshot
The regular viewpoint on PA-processes
inferred← citeshttps://doi.org/10.1007/s00236-007-0055-yopenalex-snapshot
Recursive Petri nets
inferred← citeshttps://doi.org/10.1016/j.conengprac.2009.03.006openalex-snapshot
Specification of a batch plant using process algebra and petri nets
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.05.005openalex-snapshot
Model Checking of Component Protocol Conformance – Optimizations by Reducing False Negatives
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00101-8openalex-snapshot
Decidability of model checking with the temporal logic EF
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00216-6openalex-snapshot
Rewrite Systems with Constraints
inferred← citeshttps://doi.org/10.1017/cbo9780511792588.004openalex-snapshot
The algorithmics of bisimilarity
inferred← citeshttps://doi.org/10.1109/acc.2001.945769openalex-snapshot
Combined process algebra and Petri nets for specification of resource booking problems
inferred← citeshttps://doi.org/10.1109/aim.2001.936825openalex-snapshot
Modeling and specification of discrete event systems using combined process algebra and Petri nets
inferred← citeshttps://doi.org/10.1109/coase.2005.1506792openalex-snapshot
Specification of a batch plant using process algebra and petri nets
inferred← citeshttps://doi.org/10.1109/coase.2007.4341688openalex-snapshot
Specification of Production Systems using PPN and Sequential Operation Charts
inferred← citeshttps://doi.org/10.1109/ecows.2008.11openalex-snapshot
Automatic Protocol Conformance Checking of Recursive and Parallel BPEL Systems
inferred← citeshttps://doi.org/10.5287/ora-7rg81n5vyopenalex-snapshot
Saturation methods for global model-checking pushdown systems
inferred← citeshttps://doi.org/10.70675/4b2e3e72z109ez4187zaf03z0371e6c18af0openalex-snapshot
Verification of Infinite-State Systems and Machine Learning
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.