831 search results - page 74 / 167 » Coalgebraic Correspondence Theory |
120
click to vote
STOC
2006
ACM
16 years 5 days ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
CONCUR
2009
Springer
15 years 6 months ago
2009
Springer
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...
ICTAC
2009
Springer
15 years 6 months ago
2009
Springer
“Classical” program development by refinement [12, 2, 3] is a technique for ensuring that source-level program code remains faithful to the semantic goals set out in its corre...
104
click to vote
LOPSTR
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. In this paper we focus on the problem of testing agent programs written in BUpL, an executable, high-level modelling agent language. Our approach consists of two main ste...
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— This paper presents a result on the robust synchronization of outputs of statically interconnected non-identical cyclic feedback systems that are used to model, among o...