An algebraic specification of process algebra, including two examples

2005 ◽  
pp. 507-554 ◽  
Author(s):  
S. Mauw
Keyword(s):  
Process Algebra ◽  
Algebraic Specification

A Study on Network Service Behavior Verification with Process Algebra and Its Application

2011 ◽  
Vol 34 (9) ◽  
pp. 1660-1668
Author(s):  
Fu CHEN ◽  
Jia-Hai YANG ◽  
Yang YANG ◽  
Yuan-Zhuo WANG ◽  
Mei-Ying JIA
Keyword(s):  
Process Algebra ◽  
Network Service ◽  
Service Behavior

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.

scholarly journals Petri-net-based deadlock analysis of Process Algebra programs

1994 ◽  
Vol 23 (1) ◽  
pp. 55-89 ◽  
Author(s):  
P. Rondogiannis ◽  
M.H.M. Cheng
Keyword(s):  
Petri Net ◽  
Process Algebra ◽  
Deadlock Analysis
Sign in / Sign up

Export Citation Format

Share Document