Sciweavers

1071 search results - page 38 / 215
» The Calculus of Algebraic Constructions
Sort
View
LICS
2000
IEEE
15 years 10 months ago
Computational Complexity of Some Problems Involving Congruences on Algebras
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
Clifford Bergman, Giora Slutzki
HYBRID
2004
Springer
15 years 11 months ago
Constructing Invariants for Hybrid Systems
Abstract. An invariant of a system is a predicate that holds for every reachable state. In this paper, we present techniques to generate invariants for hybrid systems. This is achi...
Sriram Sankaranarayanan, Henny Sipma, Zohar Manna
CDC
2008
IEEE
123views Control Systems» more  CDC 2008»
16 years 22 days ago
Fast state estimation in linear time-varying systems: An algebraic approach
— In this note, an algebraic approach for state estimation of linear time-varying (LTV) systems is introduced. This approach is based on the following mathematical tools: Laplace...
Yang Tian, Thierry Floquet, Wilfrid Perruquetti
ICALP
2004
Springer
15 years 11 months ago
Towards an Algebraic Theory of Typed Mobile Processes
The impact of types on the algebraic theory of the π-calculus is studied. The type system has capability types. They allow one to distinguish between the ability to read from a c...
Yuxin Deng, Davide Sangiorgi
TLCA
2007
Springer
16 years 11 days ago
Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
Denis Cousineau 0002, Gilles Dowek