On the public citation graph
Permutation of transitions: An event structure semantics for CCS and SCCS
0 signed · 128 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-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-17660-8_52openalex-snapshot
On the semantics of concurrency: Partial orders and transition systems
inferredcites →https://doi.org/10.1007/3-540-17945-3_13openalex-snapshot
Petri net models for algebraic theories of concurrency
inferredcites →https://doi.org/10.1007/978-3-642-82453-1_9openalex-snapshot
Notes on Algebraic Calculi of Processes
inferredcites →https://doi.org/10.1007/bf01379149openalex-snapshot
Modeling concurrency with partial orders
inferredcites →https://doi.org/10.1007/bfb0012800openalex-snapshot
Event structure semantics for CCS and related languages
inferredcites →https://doi.org/10.1007/bfb0028836openalex-snapshot
Partial ordering derivations for CCS
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(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
inferredcites →https://doi.org/10.1016/0304-3975(88)90001-1openalex-snapshot
Fiftieth volume of theoretical computer science
inferredcites →https://doi.org/10.1016/0304-3975(88)90096-5openalex-snapshot
Concurrency and atomicity
inferredcites →https://doi.org/10.1016/0890-5401(87)90013-7openalex-snapshot
Weak and strong fairness in CCS
inferredcites →https://doi.org/10.1145/322108.322122openalex-snapshot
Minimal and Optimal Computations of Recursive Programs
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.2001.3060openalex-snapshot
Contextual Petri Nets, Asymmetric Event Structures, and Processes
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_71openalex-snapshot
Equivalence notions for concurrent systems and refinement of actions
inferred← citeshttps://doi.org/10.1007/3-540-52494-0_44openalex-snapshot
CEDISYS compositional distributed systems state of the art, research goals, references
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_68openalex-snapshot
Refinement of actions in causality based models
inferred← citeshttps://doi.org/10.1007/3-540-52590-4_47openalex-snapshot
Towards the unification of models for concurrency
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_4openalex-snapshot
Flow event structures and flow nets
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_5openalex-snapshot
Three equivalent semantics for CCS
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_8openalex-snapshot
Transition systems with algebraic structure as models of computations
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_2openalex-snapshot
On causality observed incrementally, finally
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_55openalex-snapshot
The consistency of a noninterleaving and an interleaving model for full TCSP
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_169openalex-snapshot
Interleaving semantics and action refinement with atomic choice
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_180openalex-snapshot
A survey of equivalence notions for net based systems
inferred← citeshttps://doi.org/10.1007/3-540-56689-9_46openalex-snapshot
Distributed implementation of CCS
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_4openalex-snapshot
A practical technique for process abstraction
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_106openalex-snapshot
On syntactic and semantic action refinement
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_12openalex-snapshot
A complete theory of deterministic event structures
inferred← citeshttps://doi.org/10.1007/978-1-4471-3078-9_15openalex-snapshot
Possible and Guaranteed Concurrency in CSP
inferred← citeshttps://doi.org/10.1007/978-1-4471-3078-9_20openalex-snapshot
An Event-Based SOS for a Language with Refinement
inferred← citeshttps://doi.org/10.1007/978-1-4471-3217-2_12openalex-snapshot
A Causality-based Semantics for CCS
inferred← citeshttps://doi.org/10.1007/978-1-4471-3217-2_4openalex-snapshot
A Process Calculus with Incomparable Priorities
inferred← citeshttps://doi.org/10.1007/978-1-4471-3503-6_16openalex-snapshot
Concurrency and Conflict in CSP
inferred← citeshttps://doi.org/10.1007/978-1-4471-3756-6_20openalex-snapshot
Timed Process Algebra, Petri Nets, and Event Refinement
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_9openalex-snapshot
Causal Automata I: Confluence ≡ {AND, OR} Causality
inferred← citeshttps://doi.org/10.1007/978-3-030-21485-2_19openalex-snapshot
Event Structure Semantics for Multiparty Sessions
inferred← citeshttps://doi.org/10.1007/978-3-030-52482-1_4openalex-snapshot
Event Structures for the Reversible Early Internal $$\pi $$-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-030-79837-6_9openalex-snapshot
Explicit Identifiers and Contexts in Reversible Concurrent Calculus
inferred← citeshttps://doi.org/10.1007/978-3-319-40578-0_3openalex-snapshot
Static VS Dynamic Reversibility in CCS
inferred← citeshttps://doi.org/10.1007/978-3-319-99498-7_7openalex-snapshot
Event Structure Semantics of (controlled) Reversible CCS
inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_19openalex-snapshot
Reversible Communicating Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_47openalex-snapshot
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
inferred← citeshttps://doi.org/10.1007/978-3-540-76637-7_10openalex-snapshot
Scalable Simulation of Cellular Signaling Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-32784-1_10openalex-snapshot
From Transitions to Executions
inferred← citeshttps://doi.org/10.1007/978-3-642-36315-3_17openalex-snapshot
A Verification Technique for Reversible Process Algebra
inferred← citeshttps://doi.org/10.1007/978-3-642-40184-8_22openalex-snapshot
Reversibility and Asymmetric Conflict in Event Structures
inferred← citeshttps://doi.org/10.1007/bf01178923openalex-snapshot
The connection between an event structure semantics and an operational semantics forTCSP
inferred← citeshttps://doi.org/10.1007/bf01215409openalex-snapshot
When is partial trace equivalence adequate?
inferred← citeshttps://doi.org/10.1007/bf01887206openalex-snapshot
Event fairness and non-interleaving concurrency
inferred← citeshttps://doi.org/10.1007/bfb0018342openalex-snapshot
An algebraic view of interleaving and distributed operational semantics for CCS
inferred← citeshttps://doi.org/10.1007/bfb0029614openalex-snapshot
Event structures, causal trees, and refinements
inferred← citeshttps://doi.org/10.1007/bfb0053542openalex-snapshot
An event structure semantics for P/T contextual nets: Asymmetric event structures
inferred← citeshttps://doi.org/10.1007/bfb0055638openalex-snapshot
Towards performance evaluation with general distributions in process algebras
inferred← citeshttps://doi.org/10.1007/s00165-006-0088-yopenalex-snapshot
Action Refinement Applied to Late Decisions
inferred← citeshttps://doi.org/10.1007/s00236-019-00332-yopenalex-snapshot
Reversible sessions with flexible choices
inferred← citeshttps://doi.org/10.1007/s00236-019-00346-6openalex-snapshot
Static versus dynamic reversibility in CCS
inferred← citeshttps://doi.org/10.1007/s002360000041openalex-snapshot
Refinement of actions and equivalence notions for concurrent systems
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(93)90247-qopenalex-snapshot
The poset of infinitary traces
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00073-ropenalex-snapshot
On the implementation of concurrent calculi in net calculi: two case studies
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00120-4openalex-snapshot
An event structure semantics for general Petri nets
inferred← citeshttps://doi.org/10.1016/b978-0-444-89402-1.50049-7openalex-snapshot
A LOTOS Based Calculus with True Concurrency Semantics
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50033-3openalex-snapshot
Process Algebras with Localities
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.04.024openalex-snapshot
Event Structures for Interrupt Process Algebras
inferred← citeshttps://doi.org/10.1016/j.ic.2003.12.003openalex-snapshot
Models for name-passing processes: interleaving and causal
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104644openalex-snapshot
A parametric framework for reversible π-calculi
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.07.004openalex-snapshot
Reversibility and asymmetric conflict in event structures
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.10.004openalex-snapshot
Reduction of event structures under history preserving bisimulation
inferred← citeshttps://doi.org/10.1016/j.jlamp.2017.11.002openalex-snapshot
Semantics of global view of choreographies
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.01.001openalex-snapshot
Towards a categorical representation of reversible event structures
inferred← citeshttps://doi.org/10.1016/j.jlamp.2020.100631openalex-snapshot
Conflict vs causality in event structures
inferred← citeshttps://doi.org/10.1016/j.scico.2013.07.005openalex-snapshot
A verified algebra for read–write Linked Data
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.10.031openalex-snapshot
Well-behaved flow event structures for parallel composition and action refinement
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.06.028openalex-snapshot
A calculus of branching processes
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.09.006openalex-snapshot
Minimisation of event structures
inferred← citeshttps://doi.org/10.1016/s0169-7552(97)00134-7openalex-snapshot
Partial order models for quantitative extensions of LOTOS
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00104-1openalex-snapshot
Parallel product of event structures
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82524-1openalex-snapshot
Model checking of causal knowledge formulas
inferred← citeshttps://doi.org/10.1017/s096012951700010xopenalex-snapshot
Proof-relevant π-calculus: a constructive account of concurrency and causality
inferred← citeshttps://doi.org/10.1080/00207169908804799openalex-snapshot
A note on causal trees and their applications to CCS
inferred← citeshttps://doi.org/10.1109/iceccs.2005.79openalex-snapshot
The Preservation of Interleaving Equivalences
inferred← citeshttps://doi.org/10.1109/icsess.2017.8342914openalex-snapshot
Variable refinement on semi-algebraic flow event structure
inferred← citeshttps://doi.org/10.1109/lics.1991.151662openalex-snapshot
On the relationship between process algebra and input/output automata
inferred← citeshttps://doi.org/10.1109/lics.1993.287567openalex-snapshot
Self-synchronization of concurrent processes
inferred← citeshttps://doi.org/10.1109/lics.2000.855781openalex-snapshot
Models for name-passing processes: interleaving and causal
inferred← citeshttps://doi.org/10.1109/lics.2013.45openalex-snapshot
A Compositional Semantics for the Reversible p-Calculus
inferred← citeshttps://doi.org/10.1109/synasc.2013.64openalex-snapshot
Non-interleaving Operational Semantics for Geographically Replicated Databases
inferred← citeshttps://doi.org/10.1145/317636.317908openalex-snapshot
Verification of Erlang programs using abstract interpretation and model checking
inferred← citeshttps://doi.org/10.1145/3498668openalex-snapshot
Linked visualisations via Galois dependencies
inferred← citeshttps://doi.org/10.1305/ndjfl/1040046090openalex-snapshot
Algebra and Theory of Order-Deterministic Pomsets
inferred← citeshttps://doi.org/10.1587/transfun.2022map0002openalex-snapshot
Conflict Reduction of Acyclic Flow Event Structures
inferred← citeshttps://doi.org/10.1587/transfun.2024map0004openalex-snapshot
Generating Event Structure from Set of Acyclic Relations in Choreography Realization
inferred← citeshttps://doi.org/10.1609/aaai.v34i05.6199openalex-snapshot
An Operational Semantics for True Concurrency in BDI Agent Systems
inferred← citeshttps://doi.org/10.24355/dbbs.084-200511080100-103openalex-snapshot
Foundations of a Module Concept for Distributed Object Systems
inferred← citeshttps://doi.org/10.3233/fun-2005-681-204openalex-snapshot
Event Structures for Arbitrary Disruption
inferred← citeshttps://doi.org/10.4204/eptcs.223.7openalex-snapshot
A Modular Formalization of Reversibility for Concurrent Models and Languages
inferred← citeshttps://doi.org/10.4204/eptcs.276.8openalex-snapshot
A Parametric Framework for Reversible Pi-Calculi
inferred← citeshttps://doi.org/10.4204/eptcs.279.6openalex-snapshot
Realisability of Pomsets via Communicating Automata
inferred← citeshttps://doi.org/10.4204/eptcs.300.6openalex-snapshot
Conflict vs Causality in Event Structures
inferred← citeshttps://doi.org/10.4204/eptcs.365.0.2openalex-snapshot
Global Types and Event Structure Semantics for Asynchronous Multiparty Sessions
inferred← citeshttps://doi.org/10.4204/eptcs.401.2openalex-snapshot
Towards a Semantic Characterisation of Global Type Well-formedness
inferred← citeshttps://doi.org/10.4204/eptcs.91.3openalex-snapshot
A Provenance Tracking Model for Data Updates
inferred← citeshttps://doi.org/10.4230/lipics.concur.2020.7openalex-snapshot
How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation
inferred← citeshttps://doi.org/10.48550/arxiv.1403.7181openalex-snapshot
Reduction of Event Structures under History Preserving Bisimulation
inferred← citeshttps://doi.org/10.48550/arxiv.2103.15623openalex-snapshot
Enabling Replications and Contexts in Reversible Concurrent Calculus
inferred← citeshttps://doi.org/10.5281/zenodo.12720800openalex-snapshot
Reversibility in Massive Concurrent 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.