Sciweavers

171 search results - page 9 / 35
» Weak theories of linear algebra
Sort
View
JLP
2011
106views more  JLP 2011»
12 years 9 months ago
Concurrent Kleene Algebra and its Foundations
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchange law: when applied in a trace model of program semantics, one of them stands...
Tony Hoare, Bernhard Möller, Georg Struth, Ia...
EUSFLAT
2007
147views Fuzzy Logic» more  EUSFLAT 2007»
13 years 8 months ago
Various Representations and Algebraic Structure of Linear Imprecision Indices
The paper is devoted to the investigation of imprecision indices, introduced in [7]. They are used for evaluation of uncertainty (or more exactly imprecision), which is contained ...
Alexander E. Lepskiy, Andrey G. Bronevich
AMAST
2006
Springer
13 years 10 months ago
Fork Algebras as a Sufficiently Rich Universal Institution
Algebraization of computational logics in the theory of fork algebras has been a research topic for a while. This research allowed us to interpret classical first-order logic, seve...
Carlos López Pombo, Marcelo F. Frias
CDC
2009
IEEE
137views Control Systems» more  CDC 2009»
13 years 4 months ago
Switching time estimation for linear switched systems: an algebraic approach
This paper aims at estimating the switching time for linear switched systems, i.e. the time instant when a sub-model is switched on while another one is switched off. Assuming that...
Yang Tian, Thierry Floquet, Lotfi Belkoura, Wilfri...
CONCUR
2009
Springer
14 years 1 months ago
Weighted Bisimulation in Linear Algebraic Form
Abstract. We study bisimulation and minimization for weighted automata, relying on a geometrical representation of the model, linear weighted automata (lwa). In a lwa, the state-sp...
Michele Boreale