391 search results - page 45 / 79 » Compositionality for Probabilistic Automata |
119
Voted
ACSD
2006
IEEE
15 years 8 months ago
2006
IEEE
Timed Automata (TA) and Time Petri Nets (TPN) are two well-established formal models for real-time systems. Recently, a linear transformation of TA to TPNs preserving reachability...
136
Voted
ECAI
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. This paper shows that we can take advantage of information about the probabilities of the occurrences of events, when this information is available, to refine the classic...
113
Voted
FM
2006
Springer
15 years 6 months ago
2006
Springer
We propose a new look at one of the most fundamental types of behavioral interfaces: discrete time specifications of communication--directly related to the work of de Alfaro and H...
123
Voted
COORDINATION
2009
Springer
15 years 12 days ago
2009
Springer
Abstract. Recent approaches to component-based software engineering employ coordinating connectors to compose components into software systems. For maximum flexibility and reuse, s...
218
Voted
ICDT
2009
ACM
16 years 3 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...