5510 search results - page 243 / 1102 » Mathematics |
145
click to vote
CALCO
2009
Springer
16 years 10 days ago
2009
Springer
We generalize the unfolding semantics, previously developed for concrete formalisms such as Petri nets and graph grammars, to the setting of (single pushout) rewriting over adhesiv...
148
click to vote
CALCO
2009
Springer
16 years 10 days ago
2009
Springer
Abstract. Labelled Markov processes are continuous-state fully probabilistic labelled transition systems. They can be seen as co-algebras of a suitable monad on the category of mea...
137
click to vote
CALCO
2009
Springer
16 years 10 days ago
2009
Springer
d abstract) Sam Staton Computer Laboratory, University of Cambridge Abstract. A labelled transition system can be understood as a coalgebra for a particular endofunctor on the cate...
180
click to vote
CALCO
2009
Springer
16 years 10 days ago
2009
Springer
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
150
click to vote
CALCO
2009
Springer
16 years 10 days ago
2009
Springer
The exactness properties of coproducts in extensive categories and pushouts along monos in adhesive categories have found various applications in theoretical computer science, e.g....