Timing Properties of Synchronous Systems

2008 ◽  
pp. 41-70
Keyword(s):  
Synchronous Systems ◽  
Timing Properties

Timing Properties of Synchronous Systems

2000 ◽  
pp. 43-67
Author(s):  
Ivan S. Kourtev ◽  
Eby G. Friedman
Keyword(s):  
Synchronous Systems ◽  
Timing Properties

Creating Directory Structures in Replicated, Synchronous Systems

2011 ◽  
Author(s):  
Brahma Dathan ◽  
Divya Baireddy
Keyword(s):  
Synchronous Systems

Timing properties of BGO scintillator

1981 ◽  
Vol 188 (2) ◽  
pp. 403-409 ◽  
Author(s):  
M. Moszyński ◽  
C. Gresset ◽  
J. Vacher ◽  
R. Odru
Keyword(s):  
Timing Properties

scholarly journals Persistent Stochastic Non-Interference

2021 ◽  
Vol 181 (1) ◽  
pp. 1-35
Author(s):  
Jane Hillston ◽  
Andrea Marin ◽  
Carla Piazza ◽  
Sabina Rossi
Keyword(s):  
Process Algebra ◽  
Operational Semantics ◽  
Evaluation Process ◽  
Decision Algorithm ◽  
Secure Systems ◽  
Information Flow Security ◽  
Structural Operational Semantics ◽  
Timing Properties ◽  
Functional Point ◽  
Security Property

In this paper, we study an information flow security property for systems specified as terms of a quantitative Markovian process algebra, namely the Performance Evaluation Process Algebra (PEPA). We propose a quantitative extension of the Non-Interference property used to secure systems from the functional point view by assuming that the observers are able to measure also the timing properties of the system, e.g., the response time of certain actions or its throughput. We introduce the notion of Persistent Stochastic Non-Interference (PSNI) based on the idea that every state reachable by a process satisfies a basic Stochastic Non-Interference (SNI) property. The structural operational semantics of PEPA allows us to give two characterizations of PSNI: one based on a bisimulation-like equivalence relation inducing a lumping on the underlying Markov chain, and another one based on unwinding conditions which demand properties of individual actions. These two different characterizations naturally lead to efficient methods for the verification and construction of secure systems. A decision algorithm for PSNI is presented and an application of PSNI to a queueing system is discussed.

Fault-tolerant oblivious assignment with slots in synchronous systems

2014 ◽  
Vol 74 (7) ◽  
pp. 2648-2661
Author(s):  
Giuseppe Ateniese ◽  
Roberto Baldoni ◽  
Silvia Bonomi ◽  
Giuseppe Antonio Di Luna
Keyword(s):  
Fault Tolerant ◽  
Synchronous Systems
Sign in / Sign up

Export Citation Format

Share Document