There is a need for a language able to reconcile the recent upsurge of interest in quantitative methods in the software sciences with logic and set theory that have been used for so many years in capturing the qualitative aspects of the same body of knowledge. Such a lingua franca should be typed, polymorphic, diagrammatic, calculational and easy to blend with traditional notation. This paper puts forward typed linear algebra (LA) as a candidate notation for such a role. Typed LA emerges from regarding matrices as morphisms of suitable categories whereby traditional linear algebra is equipped with a type system. In this paper we show typed LA at work in describing weighted (prob- abilistic) automata. Some attention is paid to the interfac...
Abstract—This paper presents a novel linear process alge-braic format for probabilistic automata. Th...
AbstractThis paper presents a novel linear process-algebraic format for probabilistic automata. The ...
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They d...
There is a need for a language able to reconcile the recent upsurge of interest in quantitative meth...
We present a comprehensive overview of automata tech-niques for deciding first order logical theorie...
Interested in formalizing the generation of fast running code for linear algebra applications, the a...
htmlabstractWeighted automata are a generalization of non-deterministic automata where each transiti...
Abstract. The Algebra of Programming (AoP) is a discipline for programming from specifications using...
This paper presents a novel linear process-algebraic format for probabilistic automata. The key ingr...
We introduce notions of simulation between semiring-weighted automata as models of quantitative syst...
This paper presents a novel linear process algebraic format for probabilistic automata. The key ingr...
International audienceInterested in formalizing the generation of fast running code for linear algeb...
This paper presents a novel linear process-algebraic format for probabilistic automata. The key ingr...
Motivated by the need to formalize generation of fast running code for linear algebra applications, ...
AbstractA Linear Logic automaton is a hybrid of a finite automaton and a non-deterministic Petri net...
Abstract—This paper presents a novel linear process alge-braic format for probabilistic automata. Th...
AbstractThis paper presents a novel linear process-algebraic format for probabilistic automata. The ...
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They d...
There is a need for a language able to reconcile the recent upsurge of interest in quantitative meth...
We present a comprehensive overview of automata tech-niques for deciding first order logical theorie...
Interested in formalizing the generation of fast running code for linear algebra applications, the a...
htmlabstractWeighted automata are a generalization of non-deterministic automata where each transiti...
Abstract. The Algebra of Programming (AoP) is a discipline for programming from specifications using...
This paper presents a novel linear process-algebraic format for probabilistic automata. The key ingr...
We introduce notions of simulation between semiring-weighted automata as models of quantitative syst...
This paper presents a novel linear process algebraic format for probabilistic automata. The key ingr...
International audienceInterested in formalizing the generation of fast running code for linear algeb...
This paper presents a novel linear process-algebraic format for probabilistic automata. The key ingr...
Motivated by the need to formalize generation of fast running code for linear algebra applications, ...
AbstractA Linear Logic automaton is a hybrid of a finite automaton and a non-deterministic Petri net...
Abstract—This paper presents a novel linear process alge-braic format for probabilistic automata. Th...
AbstractThis paper presents a novel linear process-algebraic format for probabilistic automata. The ...
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They d...