On the public citation graph
Causal trees
0 signed · 130 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_54openalex-snapshot
A fully observational model for infinite behaviours of communicating systems
inferredcites →https://doi.org/10.1007/3-540-18419-8_12openalex-snapshot
Views of distributed systems
inferredcites →https://doi.org/10.1007/3-540-50580-6_25openalex-snapshot
An exercise in concurrency: A CSP process as a condition/event system
inferredcites →https://doi.org/10.1007/978-94-009-7893-5_14openalex-snapshot
Behaviors of Processes and Synchronized Systems of Processes
inferredcites →https://doi.org/10.1007/bf01379149openalex-snapshot
Modeling concurrency with partial orders
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(84)90067-7openalex-snapshot
Algèbre de processus et synchronisation
inferredcites →https://doi.org/10.1016/0304-3975(88)90096-5openalex-snapshot
Concurrency and atomicity
inferredcites →https://doi.org/10.1016/s0019-9958(84)80025-xopenalex-snapshot
Process algebra for synchronous communication
inferredcites →https://doi.org/10.1109/lics.1988.5112openalex-snapshot
On the consistency of 'truly concurrent' operational and denotational semantics
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.1995.1066openalex-snapshot
Split and ST Bisimulation Semantics
inferred← citeshttps://doi.org/10.1006/inco.1998.2726openalex-snapshot
On Performance Congruences for Process Algebras
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-48320-9_29openalex-snapshot
A Partial Order Event Model for Concurrent Objects
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_31openalex-snapshot
Comparison of Process Algebra Equivalences Using Formats
inferred← citeshttps://doi.org/10.1007/3-540-49727-7_10openalex-snapshot
Constructing Specific SOS Semantics for Concurrency via Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_10openalex-snapshot
Causal trees interleaving + causality
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-53487-3_53openalex-snapshot
Observational logics and concurrency models
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_1openalex-snapshot
Full abstraction for series-parallel pomsets
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-54345-7_55openalex-snapshot
Atomic refinement in process description languages
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_170openalex-snapshot
Maximality preservation and the ST-idea for action refinements
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_109openalex-snapshot
A parametric approach to localities
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_53openalex-snapshot
On relating some models for concurrency
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_62openalex-snapshot
From π-calculus to higher-order π-calculus — and back
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_102openalex-snapshot
Extended transition systems for parametric bisimulation
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_46openalex-snapshot
Proof systems for cause based equivalences
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_8openalex-snapshot
On the ill-timed but well-caused
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_107openalex-snapshot
Locality and true-concurrency in calculi for mobile processes
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_77openalex-snapshot
A fully abstract semantics for causality in the π-calculus
inferred← citeshttps://doi.org/10.1007/3-540-59155-9_10openalex-snapshot
Concurrency and Concurrent Constraint Programming
inferred← citeshttps://doi.org/10.1007/3-540-59450-7_4openalex-snapshot
Distributed conflicts in communicating systems
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_59openalex-snapshot
Causality and true concurrency: A data-flow analysis of the Pi-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_113openalex-snapshot
Causality for mobile processes
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_11openalex-snapshot
A Petri net semantics for π-calculus
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_4openalex-snapshot
Checking bisimilarity for finitary π-calculus
inferred← citeshttps://doi.org/10.1007/3-540-60222-4_95openalex-snapshot
An efficient verifier of truly concurrent properties
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_150openalex-snapshot
Performance preorder: Ordering processes with respect to speed
inferred← citeshttps://doi.org/10.1007/3-540-60688-2_41openalex-snapshot
Complexity as a basis for comparing semantic models of concurrency
inferred← citeshttps://doi.org/10.1007/3-540-61363-3_7openalex-snapshot
Non sequential semantics for contextual P/T nets
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_153openalex-snapshot
Mobile processes with a distributed environment
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-3-031-90897-2_4openalex-snapshot
Alternative Characterizations of Hereditary History-Preserving Bisimilarity via Backward Ready Multisets
inferred← citeshttps://doi.org/10.1007/978-3-319-23506-6_8openalex-snapshot
Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-39866-0_30openalex-snapshot
Causality and Replication in Concurrent Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_46openalex-snapshot
A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_3openalex-snapshot
On the Decidability of Non-Interleaving Process Equivalences
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-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-540-77312-2_10openalex-snapshot
Causality in Membrane Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-92188-2_8openalex-snapshot
Causal Semantics for the Algebra of Connectors
inferred← citeshttps://doi.org/10.1007/978-3-642-17164-2_29openalex-snapshot
Concurrency Can’t Be Observed, Asynchronously
inferred← citeshttps://doi.org/10.1007/bf01178730openalex-snapshot
Comparing locality and causality based equivalences
inferred← citeshttps://doi.org/10.1007/bf01221098openalex-snapshot
A theory of processes with localities
inferred← citeshttps://doi.org/10.1007/bf03259392openalex-snapshot
Automatizing Parametric Reasoning on Distributed Concurrent Systems
inferred← citeshttps://doi.org/10.1007/bfb0013471openalex-snapshot
Applications of the calculus of trees to process description languages
inferred← citeshttps://doi.org/10.1007/bfb0015456openalex-snapshot
Event automata as a generic model of reactive systems
inferred← citeshttps://doi.org/10.1007/bfb0023477openalex-snapshot
Minimal transition systems for history-preserving bisimulation
inferred← citeshttps://doi.org/10.1007/bfb0029614openalex-snapshot
Event structures, causal trees, and refinements
inferred← citeshttps://doi.org/10.1007/bfb0032743openalex-snapshot
True concurrency via abstract interpretation
inferred← citeshttps://doi.org/10.1007/bfb0035394openalex-snapshot
An automata based verification environment for mobile processes
inferred← citeshttps://doi.org/10.1007/bfb0052091openalex-snapshot
Observing partial order runs of Petri Nets
inferred← citeshttps://doi.org/10.1007/bfb0084786openalex-snapshot
A theory of processes with localities
inferred← citeshttps://doi.org/10.1007/pl00013313openalex-snapshot
‘Closed Interval Process Algebra’ versus ‘Interval Process Algebra’
inferred← citeshttps://doi.org/10.1007/s00165-015-0341-3openalex-snapshot
A reduced maximality labeled transition system generation for recursive Petri nets
inferred← citeshttps://doi.org/10.1007/s00236-020-00377-4openalex-snapshot
Team bisimilarity, and its associated modal logic, for BPP nets
inferred← citeshttps://doi.org/10.1007/s002360000041openalex-snapshot
Refinement of actions and equivalence notions for concurrent systems
inferred← citeshttps://doi.org/10.1007/s002360050047openalex-snapshot
Timing and causality in process algebra
inferred← citeshttps://doi.org/10.1007/s002360050107openalex-snapshot
Performance preorder and competitive equivalence
inferred← citeshttps://doi.org/10.1007/s002360050124openalex-snapshot
A fully abstract semantics for causality in the $\pi$ -calculus
inferred← citeshttps://doi.org/10.1007/s002360050164openalex-snapshot
Causality for debugging mobile agents
inferred← citeshttps://doi.org/10.1007/s10994-025-06855-5openalex-snapshot
Causality from bottom to top: a survey
inferred← citeshttps://doi.org/10.1016/0164-1212(93)90019-topenalex-snapshot
An efficient implementation model for the FP2 parallel language
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90095-yopenalex-snapshot
A partial ordering semantics for CCS
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90157-oopenalex-snapshot
Bisimulation and action refinement
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90361-vopenalex-snapshot
Refinement of actions in event structures and causal trees
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00205-wopenalex-snapshot
A theory of processes with durational actions
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00020-8openalex-snapshot
Locality and interleaving semantics in calculi for mobile processes
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50033-3openalex-snapshot
Process Algebras with Localities
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.2009.06.001openalex-snapshot
Non-interleaving bisimulation equivalences on Basic Parallel Processes
inferred← citeshttps://doi.org/10.1016/j.jlamp.2017.11.005openalex-snapshot
Verification of finite-state machines: A distributed approach
inferred← citeshttps://doi.org/10.1016/j.jlap.2008.08.002openalex-snapshot
Distributed semantics for the π -calculus based on Petri nets with inhibitor arcs
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.007openalex-snapshot
Causality versus true-concurrency
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.09.037openalex-snapshot
A study on team bisimulation and H-team bisimulation for BPP nets
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00093-1openalex-snapshot
Names of the π-calculus agents handled locally
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00326-1openalex-snapshot
Distributed processes and location failures
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(02)00011-7openalex-snapshot
Dynamic connectors for concurrency
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00129-4openalex-snapshot
A format for semantic equivalence comparison
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00063-1openalex-snapshot
A π-calculus with explicit substitutions
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00125-4openalex-snapshot
Some congruence properties for π-calculus bisimilarities
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)80003-6openalex-snapshot
Non-interleaving semantics for mobile processes
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00024-6openalex-snapshot
Concurrent Semantics for the π-calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80023-4openalex-snapshot
CCS Semantics via Proved Transition Systems and Rewriting Logic
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80038-6openalex-snapshot
Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80298-1openalex-snapshot
Axiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement (Extended Abstract)
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80470-0openalex-snapshot
Tiles for Concurrent and Located Calculi
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80696-6openalex-snapshot
An Introduction to History Dependent Automata
inferred← citeshttps://doi.org/10.1017/s0960129513000108openalex-snapshot
Concurrency cannot be observed, asynchronously
inferred← citeshttps://doi.org/10.1017/s0960129516000360openalex-snapshot
Order algebras: a quantitative model of interaction
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.1142/9789812562494_0053openalex-snapshot
SOME OF MY FAVOURITE RESULTS IN CLASSIC PROCESS ALGEBRA
inferred← citeshttps://doi.org/10.1145/566385.566386openalex-snapshot
Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement
inferred← citeshttps://doi.org/10.3990/1.9789036531955openalex-snapshot
On changing models in model-based testing
inferred← citeshttps://doi.org/10.4204/eptcs.412.5openalex-snapshot
Expansion Laws for Forward-Reverse, Forward, and Reverse Bisimilarities via Proved Encodings
inferred← citeshttps://doi.org/10.70675/eab868faz45d9z4b39zbf0czec19d367f3a2openalex-snapshot
Méthode de conception de logiciel système critique couplée à une démarche de vérification formelle
inferred← citeshttps://doi.org/10.7146/dpb.v19i308.6558openalex-snapshot
True concurrency can be traced
inferred← citeshttps://doi.org/10.7148/2013-0544openalex-snapshot
Maximality Semantic For Recursive Petri Nets
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.