2128 search results - page 75 / 426 » A general characterization of indulgence |
151
click to vote
ENTCS
1998
15 years 4 months ago
1998
This paper shows how modal mu-calculus formulae characterizing finite-state processes up to strong or weak bisimulation can be derived directly from the well-known greatest fixp...
100
click to vote
FORMATS
2007
Springer
15 years 10 months ago
2007
Springer
We identify a class of timed automata, which we call counter-free input-determined automata, which characterize the class of timed languages definable by several timed temporal l...
112
click to vote
PODC
1989
ACM
15 years 8 months ago
1989
ACM
A deterministic message-communicating process can be characterized by a “continuous” function f which describes the relationship between the inputs and the outputs of the proc...
119
click to vote
AUTOMATICA
2010
15 years 4 months ago
2010
The paper presents an algebraic characterization of observability and span-reachability of bilinear hybrid systems without guards, i.e. hybrid systems whose continuous dynamics is...
137
click to vote
JSAC
2010
14 years 11 months ago
2010
Abstract--In this paper, we formulate a flow control optimization problem for wireless sensor networks with lifetime constraint and link interference in an asynchronous setting. Ou...