On the public citation graph

Axiomatizing the algebra of net computations and processes

0 signed · 99 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-15670-4_10openalex-snapshot

Lectures on a calculus for communicating systems

inferredcites →https://doi.org/10.1007/3-540-52590-4_47openalex-snapshot

Towards the unification of models for concurrency

inferredcites →https://doi.org/10.1007/3-540-55719-9_105openalex-snapshot

Timing Petri Nets categorically

inferredcites →https://doi.org/10.1007/3-540-58152-9_3openalex-snapshot

On the model of computation of place/transition Petri nets

inferredcites →https://doi.org/10.1007/978-1-4612-9839-7openalex-snapshot

Categories for the Working Mathematician

inferredcites →https://doi.org/10.1007/978-3-642-69968-9openalex-snapshot

Petri Nets

inferredcites →https://doi.org/10.1007/978-3-642-82921-5openalex-snapshot

Control Flow and Data Flow: Concepts of Distributed Programming

inferredcites →https://doi.org/10.1007/bf01379149openalex-snapshot

Modeling concurrency with partial orders

inferredcites →https://doi.org/10.1007/bf01463946openalex-snapshot

Branching processes of Petri nets

inferredcites →https://doi.org/10.1007/bfb0018343openalex-snapshot

Temporal Structures

inferredcites →https://doi.org/10.1007/bfb0022474openalex-snapshot

Petri nets, event structures and domains

inferredcites →https://doi.org/10.1007/bfb0039047openalex-snapshot

SCONE: A simple calculus of nets

inferredcites →https://doi.org/10.1007/bfb0084798openalex-snapshot

On the semantics of Petri Nets

inferredcites →https://doi.org/10.1016/0022-0000(87)90032-8openalex-snapshot

Concurrent histories: A basis for observing distributed systems

inferredcites →https://doi.org/10.1016/0304-3975(80)90004-3openalex-snapshot

Behaviours of concurrent systems

inferredcites →https://doi.org/10.1016/0304-3975(81)90112-2openalex-snapshot

Petri nets, event structures and domains, part I

inferredcites →https://doi.org/10.1016/0304-3975(87)90090-9openalex-snapshot

Sequential and concurrent behaviour in Petri net theory

inferredcites →https://doi.org/10.1016/0304-3975(88)90124-7openalex-snapshot

The equational theory of pomsets

inferredcites →https://doi.org/10.1016/0304-3975(95)00121-2openalex-snapshot

Process versus unfolding semantics for Place/Transition Petri nets

inferredcites →https://doi.org/10.1016/0890-5401(90)90013-8openalex-snapshot

Petri nets are monoids

inferredcites →https://doi.org/10.1016/s0019-9958(83)80040-0openalex-snapshot

The non-sequential behaviour of Petri nets

inferredcites →https://doi.org/10.1016/s0065-2458(08)60462-3openalex-snapshot

Information and Computation

inferredcites →https://doi.org/10.1017/s0960129500000062openalex-snapshot

From Petri nets to linear logic

inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot

Lecture Notes in Computer Science 1205

inferredcites →https://doi.org/10.1109/lics.1988.5114openalex-snapshot

Petri nets are monoids: a new algebraic foundation for net theory

inferredcites →https://doi.org/10.1109/lics.1990.113746openalex-snapshot

Normal process representatives

inferredcites →https://doi.org/10.1142/s0129054191000182openalex-snapshot

FROM PETRI NETS TO LINEAR LOGIC THROUGH CATEGORIES: A SURVEY

inferredcites →https://doi.org/10.1145/96709.96715openalex-snapshot

Implicative formulae in the proofs of computations' analogy

inferredcites →https://doi.org/10.14279/depositonce-21082openalex-snapshot

Universal algebra in S-monoidal categories

inferredcites →https://doi.org/10.7146/dpb.v22i435.6752openalex-snapshot

Completeness Results for Linear Logic on Petri Nets

inferredcites →https://doi.org/10.7146/dpb.v6i78.7691openalex-snapshot

Concurrent Program Schemes and their Interpretations

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.2819openalex-snapshot

Zero-Safe Nets: Comparing the Collective and Individual Token Approaches

inferred← citeshttps://doi.org/10.1006/inco.1999.2825openalex-snapshot

Tile Formats for Located and Mobile Systems

inferred← citeshttps://doi.org/10.1006/inco.2001.3050openalex-snapshot

Functorial Models for Petri Nets

inferred← citeshttps://doi.org/10.1007/10721975_1openalex-snapshot

Rewriting Logic and Maude: Concepts and Applications

inferred← citeshttps://doi.org/10.1007/3-540-44919-1_23openalex-snapshot

On Synchronicity and Concurrency in Petri Nets

inferred← citeshttps://doi.org/10.1007/3-540-44988-4_10openalex-snapshot

Process Semantics of Petri Nets over Partial Algebra

inferred← citeshttps://doi.org/10.1007/3-540-45022-x_15openalex-snapshot

Algebraic Models for Contextual Nets

inferred← citeshttps://doi.org/10.1007/3-540-45541-8_12openalex-snapshot

Transactions and Zero-Safe Nets

inferred← citeshttps://doi.org/10.1007/3-540-45541-8_13openalex-snapshot

Two Algebraic Process Semantics for Contextual Nets

inferred← citeshttps://doi.org/10.1007/3-540-45541-8_6openalex-snapshot

Petri Nets over Partial Algebra

inferred← citeshttps://doi.org/10.1007/3-540-45541-8_9openalex-snapshot

Rewriting Logic as a Unifying Framework for Petri Nets

inferred← citeshttps://doi.org/10.1007/3-540-48320-9_29openalex-snapshot

A Partial Order Event Model for Concurrent Objects

inferred← citeshttps://doi.org/10.1007/3-540-48483-3_3openalex-snapshot

Normal Forms for Partitions and Relations

inferred← citeshttps://doi.org/10.1007/3-540-49366-2_18openalex-snapshot

A Comparison of Petri Net Semantics under the Collective Token Philosophy

inferred← citeshttps://doi.org/10.1007/3-540-61604-7_64openalex-snapshot

Rewriting logic as a semantic framework for concurrency: a progress report

inferred← citeshttps://doi.org/10.1007/3-540-63141-0_28openalex-snapshot

Algebraic characterization of petri net pomset semantics

inferred← citeshttps://doi.org/10.1007/3-540-64299-4_30openalex-snapshot

Zero-safe nets: The individual token approach

inferred← citeshttps://doi.org/10.1007/978-3-319-23165-5_1openalex-snapshot

José Meseguer: Scientist and Friend Extraordinaire

inferred← citeshttps://doi.org/10.1007/978-3-319-23165-5_9openalex-snapshot

A Normal Form for Stateful Connectors

inferred← citeshttps://doi.org/10.1007/978-3-319-25527-9_17openalex-snapshot

Language Representability of Finite P/T Nets

inferred← citeshttps://doi.org/10.1007/978-3-540-31847-7_1openalex-snapshot

On the Concurrent Semantics of Algebraic Graph Grammars

inferred← citeshttps://doi.org/10.1007/978-3-540-40020-2_8openalex-snapshot

Pre-nets, Read Arcs and Unfolding: A Functorial Presentation

inferred← citeshttps://doi.org/10.1007/978-3-540-45208-9_21openalex-snapshot

Algebraic Theories for Contextual Pre-nets

inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_1openalex-snapshot

Ugo Montanari in a Nutshell

inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_31openalex-snapshot

Models of Computation: A Tribute to Ugo Montanari’s Vision

inferred← citeshttps://doi.org/10.1007/978-3-540-79980-1_5openalex-snapshot

Petri Nets Are Dioids

inferred← citeshttps://doi.org/10.1007/978-3-642-02424-5_2openalex-snapshot

Unifying Petri Net Semantics with Token Flows

inferred← citeshttps://doi.org/10.1007/978-3-642-16310-4_2openalex-snapshot

Twenty Years of Rewriting Logic

inferred← citeshttps://doi.org/10.1007/978-3-642-23217-6_4openalex-snapshot

On Causal Semantics of Petri Nets

inferred← citeshttps://doi.org/10.1007/978-3-642-58622-4_10openalex-snapshot

Research Directions in Rewriting Logic

inferred← citeshttps://doi.org/10.1007/978-94-017-1317-7_1openalex-snapshot

Action and Change in Rewriting Logic

inferred← citeshttps://doi.org/10.1007/bfb0052092openalex-snapshot

Representation theorems for Petri Nets

inferred← citeshttps://doi.org/10.1007/bfb0055061openalex-snapshot

Concatenable graph processes: Relating processes and derivation traces

inferred← citeshttps://doi.org/10.1007/bfb0055062openalex-snapshot

Axioms for contextual net processes

inferred← citeshttps://doi.org/10.1007/s00236-018-0314-0openalex-snapshot

Petri nets are dioids: a new algebraic foundation for non-deterministic net theory

inferred← citeshttps://doi.org/10.1007/s40595-015-0051-zopenalex-snapshot

Language representability of finite place/transition Petri nets

inferred← citeshttps://doi.org/10.1016/0304-3975(92)90182-fopenalex-snapshot

Conditional rewriting logic as a unified model of concurrency

inferred← citeshttps://doi.org/10.1016/0304-3975(95)00121-2openalex-snapshot

Process versus unfolding semantics for Place/Transition Petri nets

inferred← citeshttps://doi.org/10.1016/j.ic.2021.104706openalex-snapshot

Abstract processes and conflicts in place/transition systems

inferred← citeshttps://doi.org/10.1016/j.ic.2022.104939openalex-snapshot

Abstract processes in the absence of conflicts in general place/transition systems

inferred← citeshttps://doi.org/10.1016/j.ipl.2011.03.013openalex-snapshot

Abstract processes of place/transition systems

inferred← citeshttps://doi.org/10.1016/j.jlamp.2020.100526openalex-snapshot

Spreading nets: A uniform approach to unfoldings

inferred← citeshttps://doi.org/10.1016/j.jlap.2012.06.003openalex-snapshot

Twenty years of rewriting logic

inferred← citeshttps://doi.org/10.1016/j.jmsy.2018.04.006openalex-snapshot

Dynamic production system identification for smart manufacturing systems

inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00165-7openalex-snapshot

A causal semantics for CCS via rewriting logic

inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00318-8openalex-snapshot

Normal forms for algebras of connections

inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00362-0openalex-snapshot

Comparing logics for rewriting: rewriting logic, action calculi and tile logic

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00047-7openalex-snapshot

An Actor Rewriting Theory

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80192-0openalex-snapshot

Concurrency for Graph Grammars in a Petri net shell

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80746-1openalex-snapshot

Relating axiomatic and operational semantics of place/transition nets

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80937-xopenalex-snapshot

Some algebraic laws for spans (and their connections with multirelations)1 1Research partly supported by the EC TMR Network getgrats and by the Italian MURST Project tosca.

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80949-6openalex-snapshot

Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80950-2openalex-snapshot

Unifying Petri Nets with Restricted Occurrence Rule Using Partial Algebra

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80302-0openalex-snapshot

Functorial semantics for Petri nets under the individual token philosophy

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80466-9openalex-snapshot

Zero-Safe Nets, or Transition Synchronization Made Simple

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80470-0openalex-snapshot

Tiles for Concurrent and Located Calculi

inferred← citeshttps://doi.org/10.1017/s096012959700248xopenalex-snapshot

An axiomatization of the category of Petri net computations

inferred← citeshttps://doi.org/10.1051/ita:2007033openalex-snapshot

Calculi of net structures and sets are similar

inferred← citeshttps://doi.org/10.1109/lics.2017.8005135openalex-snapshot

Domains and event structures for fusions

inferred← citeshttps://doi.org/10.1109/wsc.2007.4419655openalex-snapshot

Semantics of petri nets: A comparison

inferred← citeshttps://doi.org/10.1142/9789812562494_0057openalex-snapshot

THE ALGEBRAIC STRUCTURE OF PETRI NETS

inferred← citeshttps://doi.org/10.1142/9789812814951_0003openalex-snapshot

CONCURRENT SEMANTICS OF ALGEBRAIC GRAPH TRANSFORMATIONS

inferred← citeshttps://doi.org/10.1145/3559103openalex-snapshot

Whole-grain Petri Nets and Processes

inferred← citeshttps://doi.org/10.4204/eptcs.279.5openalex-snapshot

Toward a Uniform Approach to the Unfolding of Nets

inferred← citeshttps://doi.org/10.48550/arxiv.1904.12974openalex-snapshot

Computational Petri Nets: Adjunctions Considered Harmful

inferred← citeshttps://doi.org/10.5281/zenodo.26433openalex-snapshot

Gynandromorphism In Ants.

inferred← citeshttps://doi.org/10.5281/zenodo.41742openalex-snapshot

Superimposed Or Time-Multiplexed Training: A Performance Comparison

inferred← citeshttps://doi.org/10.7146/brics.v5i17.19423openalex-snapshot

A Comparison of Petri Net Semantics under the Collective Token Philosophy

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.