427 search results - page 35 / 86 » On the Power of Labels in Transition Systems |
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We prove several decidability and undecidability results for -PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of...
109
click to vote
FORMATS
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Continuous-time Markov decision process are an important variant of labelled transition systems having nondeterminism through labels and stochasticity through exponential...
OSDI
2008
ACM
16 years 2 days ago
2008
ACM
Active research is being conducted in reducing power consumption of all the components of the Internet. To that end, we propose schemes for power reduction in network switches - T...
114
click to vote
ENTCS
2008
14 years 12 months ago
2008
Constraint automata have been used as an operational model for component connectors described in the coordination language Reo which specifies the cooperation and communication of...
104
click to vote
NIPS
2004
15 years 1 months ago
2004
We describe semi-Markov conditional random fields (semi-CRFs), a conditionally trained version of semi-Markov chains. Intuitively, a semiCRF on an input sequence x outputs a "...