HYPE: A Process Algebra for Compositional Flows and Emergent Behaviour

Author(s):  
Vashti Galpin ◽  
Luca Bortolussi ◽  
Jane Hillston
2011 ◽  
Vol 34 (9) ◽  
pp. 1660-1668
Author(s):  
Fu CHEN ◽  
Jia-Hai YANG ◽  
Yang YANG ◽  
Yuan-Zhuo WANG ◽  
Mei-Ying JIA

Author(s):  
Wai-Tat Fu ◽  
Jessie Chin ◽  
Q. Vera Liao

Cognitive science is a science of intelligent systems. This chapter proposes that cognitive science can provide useful perspectives for research on technology-mediated human-information interaction (HII) when HII is cast as emergent behaviour of a coupled intelligent system. It starts with a review of a few foundational concepts related to cognitive computations and how they can be applied to understand the nature of HII. It discusses several important properties of a coupled cognitive system and their implication to designs of information systems. Finally, it covers how levels of abstraction have been useful for cognitive science, and how these levels can inform design of intelligent information systems that are more compatible with human cognitive computations.


2021 ◽  
Vol 181 (1) ◽  
pp. 1-35
Author(s):  
Jane Hillston ◽  
Andrea Marin ◽  
Carla Piazza ◽  
Sabina Rossi

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.


Symmetry ◽  
2020 ◽  
Vol 12 (9) ◽  
pp. 1500
Author(s):  
Sara Cornejo-Bueno ◽  
Mihaela I. Chidean ◽  
Antonio J. Caamaño ◽  
Luis Prieto-Godino ◽  
Sancho Salcedo-Sanz

This paper presents a novel methodology for Climate Network (CN) construction based on the Kullback-Leibler divergence (KLD) among Membership Probability (MP) distributions, obtained from the Second Order Data-Coupled Clustering (SODCC) algorithm. The proposed method is able to obtain CNs with emergent behaviour adapted to the variables being analyzed, and with a low number of spurious or missing links. We evaluate the proposed method in a problem of CN construction to assess differences in wind speed prediction at different wind farms in Spain. The considered problem presents strong local and mesoscale relationships, but low synoptic scale relationships, which have a direct influence in the CN obtained. We carry out a comparison of the proposed approach with a classical correlation-based CN construction method. We show that the proposed approach based on the SODCC algorithm and the KLD constructs CNs with an emergent behaviour according to underlying wind speed prediction data physics, unlike the correlation-based method that produces spurious and missing links. Furthermore, it is shown that the climate network construction method facilitates the evaluation of symmetry properties in the resulting complex networks.


1994 ◽  
Vol 23 (1) ◽  
pp. 55-89 ◽  
Author(s):  
P. Rondogiannis ◽  
M.H.M. Cheng

Sign in / Sign up

Export Citation Format

Share Document