Sciweavers

575 search results - page 59 / 115
» Model Checking Restricted Sets of Timed Paths
Sort
View
DSOM
2004
Springer
15 years 5 months ago
A Formal Validation Model for the Netconf Protocol
Netconf is a protocol proposed by the IETF that defines a set of operations for network configuration. One of the main issues of Netconf is to define operations such as validate...
Sylvain Hallé, Rudy Deca, Omar Cherkaoui, R...
HYBRID
2000
Springer
15 years 3 months ago
Optimization-Based Verification and Stability Characterization of Piecewise Affine and Hybrid Systems
In this paper, we formulate the problem of characterizing the stability of a piecewise affine (PWA) system as a verification problem. The basic idea is to take the whole Rn as the ...
Alberto Bemporad, Fabio Danilo Torrisi, Manfred Mo...
ISORC
2005
IEEE
15 years 5 months ago
RMMC Programming Model and Support Execution Engine in the TMO Programming Scheme
: While the conventional remote method invocation mechanism has been considered for a long time as the primary approach for facilitating interactions among real-time objects, a mul...
K. H. (Kane) Kim, Yuqing Li, Sheng Liu, Moon-hae K...
TIT
2008
102views more  TIT 2008»
14 years 11 months ago
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
Jie Luo
COR
2008
142views more  COR 2008»
14 years 11 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma