Families of Symmetries as Efficient Models of Resource Binding

DOI10.1016/j.entcs.2010.07.014zbMath1247.68172OpenAlexW2062877417MaRDI QIDQ2919450

Vincenzo Ciancia, Ugo Montanari, Alexander Kurz

Publication date: 2 October 2012

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2010.07.014

zbMATH Keywords

coalgebrassymmetry reductionpresheavespartition refinementnamed setshistory-dependent automata

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Categorical semantics of formal languages (18C50)

Related Items (10)

Network Conscious π-calculus: A Concurrent Semantics ⋮ Causal Trees, Finally ⋮ A presheaf environment for the explicit fusion calculus ⋮ A coalgebraic semantics for causality in Petri nets ⋮ A network-conscious \(\pi\)-calculus and its coalgebraic semantics ⋮ Network-conscious \(\pi\)-calculus -- a model of Pastry ⋮ Revisiting causality, coalgebraically ⋮ Event based choreography ⋮ Fast computations on ordered nominal sets ⋮ A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours

Uses Software

• CC-Pi

Cites Work

• Models for name-passing processes: Interleaving and causal
• Symmetries, local names and dynamic (de)-allocation of names
• A new approach to abstract syntax with variable binding
• Notions of computation and monads
• About permutation algebras, (pre)sheaves and named sets
• Event based choreography
• A calculus of communicating systems
• A calculus of mobile processes. I
• Regular and exact completions
• A fully abstract model for the \(\pi\)-calculus.
• Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types
• A presheaf environment for the explicit fusion calculus
• Comparing operational models of name-passing process calculi
• Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus
• A Name Abstraction Functor for Named Sets
• A Category of Explicit Fusions
• Symmetry and Concurrency
• Connected limits, familial representability and Artin glueing
• A Categorical Model of the Fusion Calculus
• Tools and Algorithms for the Construction and Analysis of Systems
• Foundations of Software Science and Computational Structures
• CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements
• Semantic constructions for the specification of objects
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Families of Symmetries as Efficient Models of Resource Binding