391 search results - page 55 / 79 » Compositionality for Probabilistic Automata |
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
Basic message processing tasks, such as wellformedness checking and grammar validation, can be off-loaded from the service providers' own infrastructures. To enable effective...
WSC
2007
13 years 9 months ago
2007
A Monte Carlo methodology is proposed for simulating air traffic blockage patterns under the impact of convective weather. The simulation utilizes probabilistic convective weather...
ENTCS
2006
13 years 7 months ago
2006
In multilevel systems it is important to avoid unwanted indirect information flow from higher levels to lower levels, namely the so called covert channels. Initial studnformation ...
POPL
2004
ACM
14 years 7 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
Concurrent compositions of recursive programs with finite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...