Sciweavers

9370 search results - page 206 / 1874
» An Abstract Notion of Application
Sort
View
FSS
2006
90views more  FSS 2006»
15 years 6 months ago
Fuzzy submonoids, fuzzy preorders and quasi-metrics
er is an extended abstract of my paper [12] published in Fuzzy Set and Systems. We start from a residuated lattice L and a monoid M, and we define a Galois connection from the lat...
Giangiacomo Gerla
CORR
2007
Springer
82views Education» more  CORR 2007»
15 years 6 months ago
Programs as polygraphs: computability and complexity
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
Guillaume Bonfante, Yves Guiraud
JDA
2006
98views more  JDA 2006»
15 years 6 months ago
Completely connected clustered graphs
Abstract. Planar drawings of clustered graphs are considered. We introduce the notion of completely connected clustered graphs, i.e. hierarchically clustered graphs that have the p...
Sabine Cornelsen, Dorothea Wagner
ENTCS
2007
161views more  ENTCS 2007»
15 years 6 months ago
Bialgebraic Methods in Structural Operational Semantics: Invited Talk
Bialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal reasoning about well-behaved structural operational specifications. An extension of alg...
Bartek Klin
AUTOMATICA
2005
82views more  AUTOMATICA 2005»
15 years 6 months ago
Hierarchical trajectory refinement for a class of nonlinear systems
Trajectory generation for nonlinear control systems is an important and difficult problem. In this paper, we provide a constructive method for hierarchical trajectory refinement. ...
Paulo Tabuada, George J. Pappas