121 search results - page 12 / 25 » Sampled Semantics of Timed Automata |
COORDINATION
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. Reo is a channel-based coordination model whose operational semantics is given by Constraint Automata (CA). Quantitative Constraint Automata extend CA (and hence, Reo) wi...
ENTCS
2008
13 years 7 months ago
2008
Non-deterministic (also known as possibilistic) and probabilistic state based systems (or automata) have been studied for quite some time. Separately, they are reasonably well-und...
ESOP
2012
Springer
12 years 3 months ago
2012
Springer
Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in character...
COLT
1994
Springer
13 years 11 months ago
1994
Springer
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...
FORTE
2009
13 years 5 months ago
2009
Abstract. Service compositions leverage remote services to deliver addedvalue distributed applications. Since services are administered and run by independent parties, the governan...