Sciweavers

9325 search results - page 347 / 1865
» The decentralized implementability problem
Sort
View
139
Voted
ENTCS
2007
94views more  ENTCS 2007»
15 years 4 months ago
Matching of Bigraphs
We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way f...
Lars Birkedal, Troels Christoffer Damgaard, Arne J...
CONCUR
2009
Springer
15 years 2 months ago
BlenX Static and Dynamic Semantics
We introduce a new programming language called BlenX. It is strongly inspired to process calculi and it is an evolution of Betabinders. It has been specifically designed and implem...
Corrado Priami, Paola Quaglia, Alessandro Romanel
JSC
2010
83views more  JSC 2010»
14 years 11 months ago
Computing differential characteristic sets by change of ordering
We describe an algorithm for converting a characteristic set of a prime differential ideal from one ranking into another. This algorithm was implemented in many different language...
François Boulier, François Lemaire, ...
MOC
2010
14 years 11 months ago
Unified primal formulation-based a priori and a posteriori error analysis of mixed finite element methods
We derive in this paper a unified framework for a priori and a posteriori error analysis of mixed finite element discretizations of second-order elliptic problems. It is based on ...
Martin Vohralík
CDC
2008
IEEE
115views Control Systems» more  CDC 2008»
15 years 11 months ago
Optimal sensor activation in controlled discrete event systems
— The problem of sensor activation in a controlled discrete event system is considered. Sensors are assumed to be costly and can be turned on/off during the operation of the syst...
Weilin Wang, Stéphane Lafortune, Feng Lin