2015
DOI: 10.1017/s0960129515000511
|View full text |Cite
|
Sign up to set email alerts
|

Smooth coalgebra: testing vector analysis

Abstract: Processes are often viewed as coalgebras, with the structure maps specifying the state transitions. In the simplest case, the state spaces are discrete, and the structure map simply takes each state to the next states. But the coalgebraic view is also quite effective for studying processes over structured state spaces, e.g. measurable, or continuous. In the present paper we consider coalgebras over manifolds. This means that the captured processes evolve over state spaces that are not just continuous, but also… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 48 publications
0
2
0
Order By: Relevance
“…Coalgebra is the categorical toolkit for studying dynamics in general [45,48], and dynamics of computation in particular [25,43,50]. Coalgebras, as morphisms in the form X − → EX for an endofuctor E, provide a categorical view of automata, state machines, and processes with state update [20,42]; the other way around, all coalgebras can be thought of as processes with state update. In the framework on this paper, only a very special class of coalgebras will be considered, as the morphisms in the form X ×A − → X ×B, corresponding to what is usually called Mealy machines [8, 14, 17, .…”
Section: Categorical Complexity: Coalgebraic Viewmentioning
confidence: 99%
See 1 more Smart Citation
“…Coalgebra is the categorical toolkit for studying dynamics in general [45,48], and dynamics of computation in particular [25,43,50]. Coalgebras, as morphisms in the form X − → EX for an endofuctor E, provide a categorical view of automata, state machines, and processes with state update [20,42]; the other way around, all coalgebras can be thought of as processes with state update. In the framework on this paper, only a very special class of coalgebras will be considered, as the morphisms in the form X ×A − → X ×B, corresponding to what is usually called Mealy machines [8, 14, 17, .…”
Section: Categorical Complexity: Coalgebraic Viewmentioning
confidence: 99%
“…This state update provides an abstract view of dynamics. Continuous dynamics can be captured in varying the same approach [42,45]. This step from X-indexed functions to X-state machines is displayed in the first row of Table 1.…”
Section: Categorical Complexity: Coalgebraic Viewmentioning
confidence: 99%