Cartesian difference categories

DOI10.1007/978-3-030-45231-5_4MaRDI QIDQ2200813zbMATH OpenOpenAlexFDO

Authors Mario Alvarez-Picallo, Jean-Simon Pacaud Lemay

Publication date 23 September 2020

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-45231-5_4

zbMATH Keywords

Cartesian differential categoriescalculus of finite differencesstream calculusCartesian difference categorieschange actions

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Recommendations

• scientific article; zbMATH DE number 7407795
• Cartesian differential storage categories
• scientific article; zbMATH DE number 7684599
• Cartesian differential categories
• Cartesian differential categories revisited

Cites work

• scientific article; zbMATH DE number 3926220 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 176726 (Why is no real title available?)
• scientific article; zbMATH DE number 177514 (Why is no real title available?)
• scientific article; zbMATH DE number 1759425 (Why is no real title available?)
• A Theory of Communicating Sequential Processes
• A distributed algorithm for strong bisimulation reduction of state spaces
• An \(\mathcal O(m\log n)\) algorithm for computing stuttering equivalence and branching bisimulation
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Branching Bisimilarity with Explicit Divergence
• Branching time and abstraction in bisimulation semantics
• CADP 2010: a toolbox for the construction and analysis of distributed processes
• Compositional verification of asynchronous concurrent systems using CADP
• Computation tree logic with deadlock detection
• Confluence for process verification
• Nested-unit Petri nets
• Next-preserving branching bisimulation
• Partial model checking using networks of labelled transition systems and Boolean equation systems
• Propositional dynamic logic of looping and converse is elementarily decidable
• Propositional dynamic logic of regular programs
• Results on the propositional \(\mu\)-calculus
• Selective mu-calculus and formula-based equivalence of transition systems
• Three logics for branching bisimulation
• Weak confluence and \(\tau\)-inertness

Cited in

(5)

• Coherent differentiation
• Jacobians and gradients for Cartesian differential categories
• Monoidal reverse differential categories
• scientific article; zbMATH DE number 7407795 (Why is no real title available?)
• Change actions: models of generalised differentiation

This page was built for publication: Cartesian difference categories

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