Typed event structures and the linear -calculus
From MaRDI portal
Publication:964488
DOI10.1016/J.TCS.2010.01.024zbMATH Open1200.68165OpenAlexW2060704426MaRDI QIDQ964488FDOQ964488
Authors: Daniele Varacca, Nobuko Yoshida 
Publication date: 22 April 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.01.024
Recommendations
Cites Work
- A fully abstract semantics for causality in the \(\pi\)-calculus
- Petri nets, event structures and domains. I
- Non-interleaving semantics for mobile processes
- Probabilistic event structures and domains
- Title not available (Why is that?)
- Compositional Event Structure Semantics for the Internal π-Calculus
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Free Choice Petri Nets
- Models for name-passing processes: Interleaving and causal
- Title not available (Why is that?)
- Title not available (Why is that?)
- On reduction-based process semantics
- \(\pi\)-calculus, internal mobility, and agent-passing calculi
- Probabilistic \(\pi\)-calculus and event structures
- Trustworthy Global Computing
- Title not available (Why is that?)
- Ludics is a Model for the Finitary Linear Pi-Calculus
- Title not available (Why is that?)
- Strong normalisation in the \(\pi\)-calculus
- Title not available (Why is that?)
- A distributed operational semantics of CCS based on condition/event systems
- Sequential algorithms on concrete data structures
- Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus
- Causality and true concurrency: A data-flow analysis of the Pi-Calculus
- Title not available (Why is that?)
- Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS
- Concrete domains
- Title not available (Why is that?)
- A multiset semantics for the pi-calculus with replication
- CONCUR 2004 - Concurrency Theory
- Foundations of Software Science and Computation Structures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Typed event structures and the \(\pi\)-calculus (extended abstract)
- A graph abstract machine describing event structure composition
- Title not available (Why is that?)
- Foundations of Software Science and Computational Structures
- Event Structure Semantics for Nominal Calculi
- An exact correspondence between a typed pi-calculus and polarised proof-nets
Cited In (15)
- A verification technique for reversible process algebra
- Reversibility in the higher-order \(\pi\)-calculus
- A typed language for events
- Behavioural logics for configuration structures
- An interpretation of CCS into ludics
- An approach to innocent strategies as graphs
- Probabilistic \(\pi\)-calculus and event structures
- Bisimulations respecting duration and causality for the non-interleaving applied \(\pi\)-calculus
- A stable non-interleaving early operational semantics for the pi-calculus
- Global types and event structure semantics for asynchronous multiparty sessions
- A truly concurrent game model of the asynchronous \(\pi\)-calculus
- Typed event structures and the \(\pi\)-calculus (extended abstract)
- Concurrent semantics for fusions: weak prime domains and connected event structures
- Event structure semantics for multiparty sessions
- Minimisation of event structures
This page was built for publication: Typed event structures and the linear \(\pi \)-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q964488)
