On the public citation graph

Trace nets and process automata

https://doi.org/10.1007/bf01186645
0 signed · 36 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-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-53479-2_5openalex-snapshot
Three equivalent semantics for CCS
inferredcites →https://doi.org/10.1007/978-1-4612-9839-7openalex-snapshot
Categories for the Working Mathematician
inferredcites →https://doi.org/10.1007/bf00264612openalex-snapshot
Partial (set) 2-structures
inferredcites →https://doi.org/10.1007/bfb0040254openalex-snapshot
Connections between a concrete and an abstract model of concurrent systems
inferredcites →https://doi.org/10.1007/bfb0072310openalex-snapshot
Structure et Semantique Abstraites: Extension a des Categories de Morphismes d'une Paire de Foncteurs Adjoints
inferredcites →https://doi.org/10.1016/0304-3975(92)90180-nopenalex-snapshot
Elementary transition systems
inferredcites →https://doi.org/10.1093/logcom/1.6.761openalex-snapshot
Compositionality Through an Operational Semantics of Contexts
inferredcites →https://doi.org/10.1142/s0129054192000231openalex-snapshot
PETRI NETS AND STEP TRANSITION SYSTEMS
inferredcites →https://doi.org/10.3233/fi-1988-11406openalex-snapshot
A Non-Interleaving Semantics for CCS Based on Proved Transitions
inferredcites →https://doi.org/10.7146/brics.v1i12.21658openalex-snapshot
Models for Concurrency
inferredcites →https://doi.org/10.7146/dpb.v20i353.6583openalex-snapshot
Transition Systems, Event Structures and Unfoldings

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.2825openalex-snapshot
Tile Formats for Located and Mobile Systems
inferred← citeshttps://doi.org/10.1007/3-540-45541-8_14openalex-snapshot
Continuous Petri Nets and Transition Systems
inferred← citeshttps://doi.org/10.1007/3-540-63141-0_11openalex-snapshot
Synthesis of nets with inhibitor arcs
inferred← citeshttps://doi.org/10.1007/3-540-65306-6_22openalex-snapshot
Theory of regions
inferred← citeshttps://doi.org/10.1007/978-3-030-14812-6_38openalex-snapshot
The Complexity of Synthesis for 43 Boolean Petri Net Types
inferred← citeshttps://doi.org/10.1007/978-3-030-61739-4_10openalex-snapshot
The Complexity of the Label-Splitting-Problem for Flip-Flop-Nets
inferred← citeshttps://doi.org/10.1007/978-3-030-64276-1_7openalex-snapshot
The Complexity of Boolean State Separation
inferred← citeshttps://doi.org/10.1007/978-3-030-64276-1_8openalex-snapshot
Occupancy Number Restricted Boolean Petri Net Synthesis: A Fixed-Parameter Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-91268-4_3openalex-snapshot
Elementary Net Synthesis Remains NP-Complete Even for Extremely Simple Inputs
inferred← citeshttps://doi.org/10.1007/978-3-540-27793-4_1openalex-snapshot
Positive Non-interference in Elementary and Trace Nets
inferred← citeshttps://doi.org/10.1007/978-3-662-55862-1_9openalex-snapshot
Multiplicative Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-63079-2_5openalex-snapshot
The Complexity of Synthesizing $$\textsf {nop}$$-Equipped Boolean Petri Nets from g-Bounded Inputs
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.08.014openalex-snapshot
On the parameterized complexity of the synthesis of Boolean nets with restricted place environments
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80470-0openalex-snapshot
Tiles for Concurrent and Located Calculi
inferred← citeshttps://doi.org/10.1017/s0960129509990120openalex-snapshot
Structural non-interference in elementary and trace nets
inferred← citeshttps://doi.org/10.1017/s0960129509990132openalex-snapshot
Process discovery and Petri nets
inferred← citeshttps://doi.org/10.1023/a:1014305610452openalex-snapshot
From Petri Nets to Automata with Concurrency
inferred← citeshttps://doi.org/10.3233/fi-2011-505openalex-snapshot
Multiplicative Transition Systems
inferred← citeshttps://doi.org/10.3233/fi-2021-2084openalex-snapshot
The Complexity of Synthesis of $b$-Bounded Petri Nets
inferred← citeshttps://doi.org/10.4204/eptcs.304.2openalex-snapshot
Tracking Down the Bad Guys: Reset and Set Make Feasibility for Flip-Flop Net Derivatives NP-complete
inferred← citeshttps://doi.org/10.4204/eptcs.324.7openalex-snapshot
On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency
inferred← citeshttps://doi.org/10.48550/arxiv.1806.03703openalex-snapshot
Towards Completely Characterizing the Complexity of Boolean Nets Synthesis
inferred← citeshttps://doi.org/10.48550/arxiv.2007.12372openalex-snapshot
On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency (Technical Report)
inferred← citeshttps://doi.org/10.48550/arxiv.2010.00825openalex-snapshot
The Complexity of Boolean State Separation (Technical Report)
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.