Sciweavers

18 search results - page 2 / 4
» From Coalgebraic to Monoidal Traces
Sort
View
FCT
1999
Springer
13 years 9 months ago
On Recognizable Languages in Divisibility Monoids
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directi...
Manfred Droste, Dietrich Kuske
CALCO
2009
Springer
139views Mathematics» more  CALCO 2009»
13 years 12 months ago
Traces, Executions and Schedulers, Coalgebraically
A theory of traces of computations has emerged within the field of coalgebra, via finality in Kleisli categories. In concurrency theory, traces are traditionally obtained from ex...
Bart Jacobs, Ana Sokolova
ENTCS
2002
69views more  ENTCS 2002»
13 years 5 months ago
The Uniformity Principle on Traced Monoidal Categories
The uniformity principle for traced monoidal categories has been introduced as a natural generalization of the uniformity principle (Plotkin's principle) for fixpoint operato...
Masahito Hasegawa
BIRTHDAY
2008
Springer
13 years 7 months ago
Finite Dimensional Vector Spaces Are Complete for Traced Symmetric Monoidal Categories
We show that the category FinVectk of finite dimensional vector spaces and linear maps over any field k is (collectively) complete for the traced symmetric monoidal category freely...
Masahito Hasegawa, Martin Hofmann, Gordon D. Plotk...
ENTCS
2008
84views more  ENTCS 2008»
13 years 5 months ago
Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems
Non-deterministic (also known as possibilistic) and probabilistic state based systems (or automata) have been studied for quite some time. Separately, they are reasonably well-und...
Bart Jacobs