391 search results - page 27 / 79 » Compositionality for Probabilistic Automata |
RTSS
1999
IEEE
14 years 27 days ago
1999
IEEE
This paper presents a process algebra for specifying soft real-time constraints in a compositional way. For these soft constraints we take a stochastic point of view and allow arb...
ACSD
2006
IEEE
13 years 10 months ago
2006
IEEE
Reuse of IP blocks has been advocated as a means to conquer the complexity of today's system-on-chip (SoC) designs. Component integration and verification in such systems is ...
ENTCS
2008
13 years 8 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...
IFIP
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
EUROCRYPT
2004
Springer
14 years 2 months ago
2004
Springer
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...