391 search results - page 33 / 79 » Compositionality for Probabilistic Automata |
137
click to vote
CONCUR
2001
Springer
15 years 7 months ago
2001
Springer
We present a process algebraic approach for extending to the probabilistic setting the classical logical information flow analysis of computer systems. In particular, we employ a ...
125
click to vote
ARTS
1999
Springer
15 years 6 months ago
1999
Springer
In this paper we study the issue of progress for distributed timed systems modeled as the parallel composition of timed automata. We clarify the requirements of discrete progress (...
119
Voted
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
We investigate the problem of locally monitoring contract regulated behaviours in web services. We encode contract clauses in service specifications by using extended timed automat...
124
Voted
ENTCS
2002
15 years 2 months ago
2002
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos...
126
Voted
ESORICS
2002
Springer
16 years 2 months ago
2002
Springer
Confidentiality-preserving refinement describes a relation between a specification and an implementation that ensures that all confidentiality properties required in the specificat...