2 Search Results for "Loregian, Fosco"

Document
DOI: 10.4230/LIPIcs.CSL.2024.25
The Produoidal Algebra of Process Decomposition

Authors: Matt Earnshaw, James Hefford, and Mario Román

Published in: LIPIcs, Volume 288, 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)

Abstract
We characterize a universal normal produoidal category of monoidal contexts over an arbitrary monoidal category. In the same sense that a monoidal morphism represents a process, a monoidal context represents an incomplete process: a piece of a decomposition, possibly containing missing parts. In particular, symmetric monoidal contexts coincide with monoidal lenses and endow them with a novel universal property. We apply this algebraic structure to the analysis of multi-party protocols in arbitrary theories of processes.
Cite as

Matt Earnshaw, James Hefford, and Mario Román. The Produoidal Algebra of Process Decomposition. In 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 288, pp. 25:1-25:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@InProceedings{earnshaw_et_al:LIPIcs.CSL.2024.25,
  author =	{Earnshaw, Matt and Hefford, James and Rom\'{a}n, Mario},
  title =	{{The Produoidal Algebra of Process Decomposition}},
  booktitle =	{32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)},
  pages =	{25:1--25:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-310-2},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{288},
  editor =	{Murano, Aniello and Silva, Alexandra},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2024.25},
  URN =		{urn:nbn:de:0030-drops-196688},
  doi =		{10.4230/LIPIcs.CSL.2024.25},
  annote =	{Keywords: monoidal categories, profunctors, lenses, duoidal categories}
}
Document
(Co)algebraic pearls
DOI: 10.4230/LIPIcs.CALCO.2023.20
Completeness for Categories of Generalized Automata ((Co)algebraic pearls)

Authors: Guido Boccali, Andrea Laretto, Fosco Loregian, and Stefano Luneia

Published in: LIPIcs, Volume 270, 10th Conference on Algebra and Coalgebra in Computer Science (CALCO 2023)

Abstract
We present a slick proof of completeness and cocompleteness for categories of F-automata, where the span of maps E ←d E⊗ I s→ O that usually defines a deterministic automaton of input I and output O in a monoidal category (K,⊗) is replaced by a span E ← FE → O for a generic endofunctor F : K → K of a generic category K: these automata exist in their "Mealy" and "Moore" version and form categories F-Mly and F-Mre; such categories can be presented as strict 2-pullbacks in Cat and whenever F is a left adjoint, both F-Mly and F-Mre admit all limits and colimits that K admits. We mechanize our main results using the proof assistant Agda and the library https://github.com/agda/agda-categories.
Cite as

Guido Boccali, Andrea Laretto, Fosco Loregian, and Stefano Luneia. Completeness for Categories of Generalized Automata ((Co)algebraic pearls). In 10th Conference on Algebra and Coalgebra in Computer Science (CALCO 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 270, pp. 20:1-20:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@InProceedings{boccali_et_al:LIPIcs.CALCO.2023.20,
  author =	{Boccali, Guido and Laretto, Andrea and Loregian, Fosco and Luneia, Stefano},
  title =	{{Completeness for Categories of Generalized Automata}},
  booktitle =	{10th Conference on Algebra and Coalgebra in Computer Science (CALCO 2023)},
  pages =	{20:1--20:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-287-7},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{270},
  editor =	{Baldan, Paolo and de Paiva, Valeria},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2023.20},
  URN =		{urn:nbn:de:0030-drops-188174},
  doi =		{10.4230/LIPIcs.CALCO.2023.20},
  annote =	{Keywords: Deterministic automata, Moore machines, Mealy machines, coalgebras, cocomplete category}
}
  • Refine by Type
  • 2 Document/PDF

  • Refine by Publication Year
  • 1 2024
  • 1 2023

  • Refine by Author
  • 1 Boccali, Guido
  • 1 Earnshaw, Matt
  • 1 Hefford, James
  • 1 Laretto, Andrea
  • 1 Loregian, Fosco
  • Show More...

  • Refine by Series/Journal
  • 2 LIPIcs

  • Refine by Classification
  • 1 Theory of computation → Automata extensions
  • 1 Theory of computation → Automata over infinite objects
  • 1 Theory of computation → Categorical semantics
  • 1 Theory of computation → Formal languages and automata theory
  • 1 Theory of computation → Formalisms

  • Refine by Keyword
  • 1 Deterministic automata
  • 1 Mealy machines
  • 1 Moore machines
  • 1 coalgebras
  • 1 cocomplete category
  • Show More...

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact