On the public citation graph
Event structure semantics for CCS and related languages
0 signed · 224 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/978-1-4612-9839-7openalex-snapshot
Categories for the Working Mathematician
inferredcites →https://doi.org/10.1007/978-1-4757-3472-0_16openalex-snapshot
Communicating Sequential Processes
inferredcites →https://doi.org/10.1007/978-3-642-67678-9openalex-snapshot
A Compendium of Continuous Lattices
inferredcites →https://doi.org/10.1007/978-94-009-7893-5_9openalex-snapshot
Lectures on a Mathematical Theory of Computation
inferredcites →https://doi.org/10.1007/bf00266047openalex-snapshot
COSY ? a system specification language based on paths and processes
inferredcites →https://doi.org/10.1007/bfb0022474openalex-snapshot
Petri nets, event structures and domains
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/s0304-3975(82)80002-9openalex-snapshot
Sequential algorithms on concrete data structures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-13345-3_18openalex-snapshot
On the relationship of CCS and petri nets
inferred← citeshttps://doi.org/10.1007/3-540-13346-1_5openalex-snapshot
Using information systems to solve reoursive domain equations effectively
inferred← citeshttps://doi.org/10.1007/3-540-13883-8_66openalex-snapshot
Degrees of non-determinism and concurrency: A Petri net view
inferred← citeshttps://doi.org/10.1007/3-540-15198-2_2openalex-snapshot
Specification and top down design of distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-15198-2_3openalex-snapshot
Specification languages for distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-15641-0_26openalex-snapshot
Deterministic asynchronous automata
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_12openalex-snapshot
Categories of models for concurrency
inferred← citeshttps://doi.org/10.1007/3-540-17162-2_128openalex-snapshot
Category theory and models for parallel computation
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_52openalex-snapshot
On the semantics of concurrency: Partial orders and transition systems
inferred← citeshttps://doi.org/10.1007/3-540-17945-3_13openalex-snapshot
Petri net models for algebraic theories of concurrency
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_24openalex-snapshot
A modal logic for a subclass of event structures
inferred← citeshttps://doi.org/10.1007/3-540-18419-8_13openalex-snapshot
CCS is an (augmented) contact free C/E system
inferred← citeshttps://doi.org/10.1007/3-540-18419-8_9openalex-snapshot
Testing equivalences for event structures
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_147openalex-snapshot
Some behavioural aspects of net theory
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-52048-1_40openalex-snapshot
An axiomatization of event structures
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_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-54152-7_58openalex-snapshot
Invariants and paradigms of concurrency theory
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_89openalex-snapshot
The observation algebra of spatial pomsets
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_97openalex-snapshot
Invariant semantics of nets with inhibitor arcs
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-56379-2_33openalex-snapshot
Algebraic specification of concurrency
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_7openalex-snapshot
A classification of models for concurrency
inferred← citeshttps://doi.org/10.1007/3-540-58043-3_25openalex-snapshot
Relationships between models of concurrency
inferred← citeshttps://doi.org/10.1007/3-540-58152-9_3openalex-snapshot
On the model of computation of place/transition Petri nets
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-64299-4_30openalex-snapshot
Zero-safe nets: The individual token approach
inferred← citeshttps://doi.org/10.1007/3-540-65306-6_23openalex-snapshot
Petri nets and other models of concurrency
inferred← citeshttps://doi.org/10.1007/978-0-387-35271-8_30openalex-snapshot
Self-independent Petri Nets for Distributed Systems
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_16openalex-snapshot
Metric completion versus ideal completion
inferred← citeshttps://doi.org/10.1007/978-1-4471-3229-5_15openalex-snapshot
Rendez- Vous with Bundle Event Structures
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-4613-0609-2_23openalex-snapshot
A Temporal Logic for Event Structures
inferred← citeshttps://doi.org/10.1007/978-1-4615-5643-5_4openalex-snapshot
The Role of Deontic Logic in the Specification of Information Systems
inferred← citeshttps://doi.org/10.1007/978-1-4684-5511-3_13openalex-snapshot
Processes, Objects and Finite Events: On a formal model of concurrent (hardware) systems
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-031-24117-8_9openalex-snapshot
The Mays and Musts of Concurrent Strategies
inferred← citeshttps://doi.org/10.1007/978-3-031-87217-4_6openalex-snapshot
Towards a Flexible Approach for Understanding and Comparing Traces
inferred← citeshttps://doi.org/10.1007/978-3-031-99717-4_3openalex-snapshot
Bisimulations and Reversibility
inferred← citeshttps://doi.org/10.1007/978-3-032-26220-2_26openalex-snapshot
Distributed Runtime Verification in Proximity-Based Networks: A Tutorial on the Aggregate Programming Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-25150-9_14openalex-snapshot
Rigid Families for CCS and the $$\pi $$ -calculus
inferred← citeshttps://doi.org/10.1007/978-3-319-25150-9_6openalex-snapshot
On Probabilistic Distributed Strategies
inferred← citeshttps://doi.org/10.1007/978-3-319-40578-0_1openalex-snapshot
Rigid Families for the Reversible $$\pi $$ -Calculus
inferred← citeshttps://doi.org/10.1007/978-3-319-46750-4_8openalex-snapshot
Schedulers and Finishers: On Generating the Behaviours of an Event Structure
inferred← citeshttps://doi.org/10.1007/978-3-319-96154-5_10openalex-snapshot
Carl Adam Petri: A Tribute from Aarhus
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-28644-8_31openalex-snapshot
Probabilistic Event Structures and Domains
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-71316-6_23openalex-snapshot
The Java Memory Model: Operationally, Denotationally, Axiomatically
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_11openalex-snapshot
A Nice Labelling for Tree-Like Event Structures of Degree 3
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_22openalex-snapshot
Compositional Event Structure Semantics for the Internal π-Calculus
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-04081-8_24openalex-snapshot
Model-Checking Games for Fixpoint Logics with Partial Order Models
inferred← citeshttps://doi.org/10.1007/978-3-642-28729-9_15openalex-snapshot
Event Structure Semantics of Parallel Extrusion in the Pi-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-29485-3_19openalex-snapshot
Winning, Losing and Drawing in Concurrent Games with Perfect or Imperfect Information
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-82921-5_2openalex-snapshot
Distributed Systems, Partial Orderings of Events, and Event Structures
inferred← citeshttps://doi.org/10.1007/978-3-662-25209-3_31openalex-snapshot
Invariants and Paradigms of Concurrency Theory
inferred← citeshttps://doi.org/10.1007/978-3-662-45917-1_9openalex-snapshot
Interaction and Causality in Digital Signature Exchange Protocols
inferred← citeshttps://doi.org/10.1007/978-981-97-8943-6_10openalex-snapshot
Non-deterministic, Probabilistic, and Quantum Effects Through the Lens of 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/bf02811341openalex-snapshot
Models and logics for true concurrency
inferred← citeshttps://doi.org/10.1007/bf02915446openalex-snapshot
A distributed operational semantics for CCS based on condition/event systems
inferred← citeshttps://doi.org/10.1007/bf03180567openalex-snapshot
Multitraces, hypertraces and partial order semantics
inferred← citeshttps://doi.org/10.1007/bfb0000097openalex-snapshot
Graph grammars for distributed systems
inferred← citeshttps://doi.org/10.1007/bfb0013028openalex-snapshot
Permutation of transitions: An event structure semantics for CCS and SCCS
inferred← citeshttps://doi.org/10.1007/bfb0013035openalex-snapshot
Strong bisimilarity on nets: A new concept for comparing net semantics
inferred← citeshttps://doi.org/10.1007/bfb0016226openalex-snapshot
Petri nets, morphisms and compositionality
inferred← citeshttps://doi.org/10.1007/bfb0017157openalex-snapshot
On representing CCS programs by finite petri nets
inferred← citeshttps://doi.org/10.1007/bfb0017414openalex-snapshot
Programmed derivations of relational structures
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/bfb0028836openalex-snapshot
Partial ordering derivations for CCS
inferred← citeshttps://doi.org/10.1007/bfb0029614openalex-snapshot
Event structures, causal trees, and refinements
inferred← citeshttps://doi.org/10.1007/bfb0084794openalex-snapshot
Propositional temporal logics and equivalences
inferred← citeshttps://doi.org/10.1007/s00165-012-0235-6openalex-snapshot
Deterministic concurrent strategies
inferred← citeshttps://doi.org/10.1007/s00236-003-0117-8openalex-snapshot
Towards action refinement for true concurrent real time
inferred← citeshttps://doi.org/10.1007/s002360050104openalex-snapshot
Metric semantics from partial order semantics
inferred← citeshttps://doi.org/10.1007/s10626-005-5238-5openalex-snapshot
Distributed Monitoring of Concurrent and Asynchronous Systems*
inferred← citeshttps://doi.org/10.1007/s10626-006-0001-0openalex-snapshot
Trellis Processes : A Compact Representation for Runs of Concurrent Systems
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90032-8openalex-snapshot
Concurrent histories: A basis for observing distributed systems
inferred← citeshttps://doi.org/10.1016/0167-6423(93)90010-mopenalex-snapshot
Axiomatizing CCS, nets and processes
inferred← citeshttps://doi.org/10.1016/0167-739x(92)90073-kopenalex-snapshot
Invariants and paradigms of concurrency theory
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90090-9openalex-snapshot
Sequential and concurrent behaviour in Petri net theory
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90096-5openalex-snapshot
Concurrency and atomicity
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90134-4openalex-snapshot
Un modèle asynchrone pour les systèmes distribués
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90157-dopenalex-snapshot
On Scott's thesis for domains of information and well-quasi-orderings
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90193-lopenalex-snapshot
Some behavioural aspects of net theory
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90087-iopenalex-snapshot
Event structures and trace monoids
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90018-bopenalex-snapshot
Towards an algebra for timed behaviours
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90238-oopenalex-snapshot
Structure of concurrency
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00046-8openalex-snapshot
Denotational semantics in the cpo and metric approach
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00262-6openalex-snapshot
Metric completion versus ideal completion
inferred← citeshttps://doi.org/10.1016/0306-4379(91)90001-popenalex-snapshot
Formal techniques for systems specification and verification
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90032-0openalex-snapshot
Petri nets, algebras, morphisms, and compositionality
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90068-dopenalex-snapshot
Using information systems to solve recursive domain equations
inferred← citeshttps://doi.org/10.1016/b978-0-7506-0813-8.50030-7openalex-snapshot
Formal treatment of concurrency and time
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50033-3openalex-snapshot
Process Algebras with Localities
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.04.019openalex-snapshot
Typed Event Structures and the π-Calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.10.055openalex-snapshot
Event Structure Spans for Nondeterministic Dataflow
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.022openalex-snapshot
Event Structures with Symmetry
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.07.009openalex-snapshot
Probabilistic π-Calculus and Event Structures
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.09.048openalex-snapshot
Automated Software Testing of Asynchronous Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2013.09.024openalex-snapshot
Distributed Probabilistic and Quantum Strategies
inferred← citeshttps://doi.org/10.1016/j.entcs.2014.10.006openalex-snapshot
Strategies as Concurrent Processes
inferred← citeshttps://doi.org/10.1016/j.entcs.2018.10.007openalex-snapshot
An Interpretation of CCS into Ludics
inferred← citeshttps://doi.org/10.1016/j.ic.2005.10.001openalex-snapshot
True-concurrency probabilistic models
inferred← citeshttps://doi.org/10.1016/j.ic.2009.05.006openalex-snapshot
A nice labelling for tree-like event structures of degree 3
inferred← citeshttps://doi.org/10.1016/j.ic.2010.12.002openalex-snapshot
Model-checking games for fixpoint logics with partial order models
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104770openalex-snapshot
Concurrent semantics for fusions: Weak prime domains and connected event structures
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.07.002openalex-snapshot
Concurrent weighted logic
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.12.007openalex-snapshot
Declarative event based models of concurrency and refinement in psi-calculi
inferred← citeshttps://doi.org/10.1016/j.jlamp.2016.08.004openalex-snapshot
Contextual equivalences in configuration structures and reversibility
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.jss.2021.110908openalex-snapshot
Adaptive distributed monitors of spatial properties for cyber–physical systems
inferred← citeshttps://doi.org/10.1016/j.scico.2019.102323openalex-snapshot
Correct composition in the presence of behavioural conflicts and dephasing
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.015openalex-snapshot
Probabilistic event structures and domains
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.04.014openalex-snapshot
Computational self-assembly
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.06.014openalex-snapshot
Configuration structures, event structures and Petri nets
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.01.024openalex-snapshot
Typed event structures and the linear π -calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.044openalex-snapshot
Transfer of trust in event-based reputation systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.01.015openalex-snapshot
Schedulers and finishers: On generating and filtering the behaviours of an event structure
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80025-xopenalex-snapshot
Process algebra for synchronous communication
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00442-4openalex-snapshot
Axiomatizing the subsumption and subword preorders on finite and infinite partial words
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00104-1openalex-snapshot
Parallel product of event structures
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)80705-5openalex-snapshot
Metric completion versus ideal completion
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00342-4openalex-snapshot
Metric semantics for true concurrent real time
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.1017/cbo9780511770524.010openalex-snapshot
Generalized finite developments
inferred← citeshttps://doi.org/10.1017/cbo9781139195003openalex-snapshot
Process Algebra: Equational Theories of Communicating Processes
inferred← citeshttps://doi.org/10.1017/s0960129503003943openalex-snapshot
A simple process algebra based on atomic actions with resources
inferred← citeshttps://doi.org/10.1017/s0960129503004031openalex-snapshot
Transition and cancellation in concurrency and branching time
inferred← citeshttps://doi.org/10.1017/s0960129515000353openalex-snapshot
Redexes are stable in the λ-calculus
inferred← citeshttps://doi.org/10.1017/s0960129516000360openalex-snapshot
Order algebras: a quantitative model of interaction
inferred← citeshttps://doi.org/10.1017/s0960129597002314openalex-snapshot
On the semantics of place/transition Petri nets
inferred← citeshttps://doi.org/10.1080/0952813x.2020.1836034openalex-snapshot
Information flow in context-dependent hierarchical Bayesian inference
inferred← citeshttps://doi.org/10.1093/logcom/exv032openalex-snapshot
On fixpoint logics and equivalences for processes with restricted nondeterminism
inferred← citeshttps://doi.org/10.1109/iceccs.2001.930164openalex-snapshot
Action refinement for true concurrent real time
inferred← citeshttps://doi.org/10.1109/iceccs.2005.79openalex-snapshot
The Preservation of Interleaving Equivalences
inferred← citeshttps://doi.org/10.1109/lics.1990.113741openalex-snapshot
The nonexistence of finite axiomatisations for CCS congruences
inferred← citeshttps://doi.org/10.1109/lics.2006.30openalex-snapshot
Independence and Concurrent Separation Logic
inferred← citeshttps://doi.org/10.1109/lics.2017.8005135openalex-snapshot
Domains and event structures for fusions
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175727openalex-snapshot
Making Concurrency Functional
inferred← citeshttps://doi.org/10.1142/9789812562494_0057openalex-snapshot
THE ALGEBRAIC STRUCTURE OF PETRI NETS
inferred← citeshttps://doi.org/10.1145/1376804.1376811openalex-snapshot
Composing heterogeneous reactive systems
inferred← citeshttps://doi.org/10.1145/23005.24038openalex-snapshot
A model for distributed systems based on graph rewriting
inferred← citeshttps://doi.org/10.1145/248621.248623openalex-snapshot
Algebraic approaches to nondeterminism—an overview
inferred← citeshttps://doi.org/10.1145/800220.806687openalex-snapshot
Four combinators for concurrency
inferred← citeshttps://doi.org/10.14236/ewic/vocs2008.11openalex-snapshot
Events, Causality and Symmetry
inferred← citeshttps://doi.org/10.15514/ispras-2021-33(3)-11openalex-snapshot
Mechanized Theory of Event Structures: A Case of Parallel Register Machine
inferred← citeshttps://doi.org/10.2168/lmcs-4(1:6)2008openalex-snapshot
Independence and concurrent separation logic
inferred← citeshttps://doi.org/10.2168/lmcs-5(4:6)2009openalex-snapshot
Observational Equivalence and Full Abstraction in the Symmetric Interaction Combinators
inferred← citeshttps://doi.org/10.23638/lmcs-13(3:35)2017openalex-snapshot
Games and Strategies as Event Structures
inferred← citeshttps://doi.org/10.23638/lmcs-13(4:9)2017openalex-snapshot
An intensionally fully-abstract sheaf model for $\pi$ (expanded version)
inferred← citeshttps://doi.org/10.23638/lmcs-14(1:17)2018openalex-snapshot
Dynamic Causality in Event Structures
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/fi-1994-201237openalex-snapshot
COMBINING CCS AND PETRI NETS VIA STRUCTURAL AXIOMS
inferred← citeshttps://doi.org/10.3233/jcs-2008-16102openalex-snapshot
A logical framework for history-based access control and reputation systems
inferred← citeshttps://doi.org/10.3990/1.9789036507998openalex-snapshot
Quantitative and Qualitative Extensions of Event Structures
inferred← citeshttps://doi.org/10.4204/eptcs.166.3openalex-snapshot
Concurrency Models with Causality and Events as Psi-calculi
inferred← citeshttps://doi.org/10.4204/eptcs.189.7openalex-snapshot
Reversible Barbed Congruence on Configuration Structures
inferred← citeshttps://doi.org/10.4204/eptcs.246.9openalex-snapshot
Towards a Categorical Representation of Reversible Event Structures
inferred← citeshttps://doi.org/10.4230/lipics.concur.2015.58openalex-snapshot
A Framework for Transactional Consistency Models with Atomic Visibility
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.4230/lipics.csl.2017.41openalex-snapshot
Strategies with Parallel Causes
inferred← citeshttps://doi.org/10.46298/lmcs-19(2:4)2023openalex-snapshot
Causal Unfoldings and Disjunctive Causes
inferred← citeshttps://doi.org/10.48550/arxiv.0704.2355openalex-snapshot
A Nice Labelling for Tree-Like Event Structures of Degree 3
showing the first 200 of 214 · page through all 214
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.