A coalgebraic semantics for causality in Petri nets
From MaRDI portal
Publication:890619
DOI10.1016/J.JLAMP.2015.07.003zbMath1330.68196arXiv1507.06462OpenAlexW3098906682MaRDI QIDQ890619
Matteo Sammartino, Ugo Montanari, Roberto Bruni
Publication date: 10 November 2015
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.06462
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categorical semantics of formal languages (18C50)
Related Items (3)
Causal Trees, Finally ⋮ Exploring nominal cellular automata ⋮ Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Models for name-passing processes: Interleaving and causal
- Symmetries, local names and dynamic (de)-allocation of names
- About permutation algebras, (pre)sheaves and named sets
- CCS expressions, finite state processes, and three problems of equivalence
- A fully abstract semantics for causality in the \(\pi\)-calculus
- Petri nets, event structures and domains. I
- Universal coalgebra: A theory of systems
- Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types
- Bisimulation from open maps
- Revisiting causality, coalgebraically
- Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus
- A Name Abstraction Functor for Named Sets
- A Coalgebraic Perspective on Minimization and Determinization
- Families of Symmetries as Efficient Models of Resource Binding
- Relating coalgebraic notions of bisimulation
- Non-interference by Unfolding
- A Logic for True Concurrency
This page was built for publication: A coalgebraic semantics for causality in Petri nets
