2128 search results - page 75 / 426 » A general characterization of indulgence |
123
Voted
ENTCS
1998
15 years 8 days 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...
71
Voted
FORMATS
2007
Springer
15 years 6 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...
85
Voted
PODC
1989
ACM
15 years 4 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...
AUTOMATICA
2010
15 years 22 days 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...
JSAC
2010
14 years 7 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...