Revisiting causality, coalgebraically

DOI10.1007/S00236-014-0207-9MaRDI QIDQ2257982zbMATH OpenOpenAlexFDO

Authors Roberto Bruni, Ugo Montanari, Matteo Sammartino

Publication date 2 March 2015

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11568/687665

zbMATH Keywords

allocation operatorbisimilaritycategory of finite posetscategory of well-behaved coalgebrascausal semantics of concurrencycoalgebra over a presheafendofunctorevents

Mathematics Subject Classification ID

Presheaves and sheaves, stacks, descent conditions (category-theoretic aspects) (18F20) Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A coalgebraic semantics for causality in Petri nets
• Causal trees, finally
• Causality versus true-concurrency
• Causal automata
• scientific article; zbMATH DE number 1314225

Cites work

• A Coalgebraic Perspective on Minimization and Determinization
• A fully abstract semantics for causality in the \(\pi\)-calculus
• About permutation algebras, (pre)sheaves and named sets
• CCS expressions, finite state processes, and three problems of equivalence
• Coalgebraic minimization of HD-automata for the -calculus using polymorphic types
• Dynamic connectors for concurrency
• Families of symmetries as efficient models of resource binding
• scientific article; zbMATH DE number 1314223 (Why is no real title available?)
• scientific article; zbMATH DE number 1361142 (Why is no real title available?)
• scientific article; zbMATH DE number 575948 (Why is no real title available?)
• scientific article; zbMATH DE number 2172972 (Why is no real title available?)
• Minimal transition systems for history-preserving bisimulation
• Models for name-passing processes: Interleaving and causal
• Relating coalgebraic notions of bisimulation
• Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus
• Symmetries, local names and dynamic (de)-allocation of names
• Universal coalgebra: A theory of systems

Cited in

(7)

• K-causality coincides with stable causality
• Causal automata
• Distant causation in \(\mathcal C+\)
• Causal trees, finally
• TRYGVE HAAVELMO AND THE EMERGENCE OF CAUSAL CALCULUS
• Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
• A coalgebraic semantics for causality in Petri nets

This page was built for publication: Revisiting causality, coalgebraically

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2257982)