Abstract
In this paper we contrast two fundamentally different ways to approach the analysis of transition system behaviours. Both methods refer to the (finite) global state transition graph; but while method A, familiar to software system designers and process algebraists, deals with execution paths of virtually unbounded length, typically starting from a precise initial state, method B, associated with counterfactual reasoning, looks at single-step evolutions starting from all conceivable system states.
Among various possible state transition models we pick boolean nets – a generalisation of cellular automata in which all nodes fire synchronously. Our nets shall be composed of parts P and Q that interact by shared variables. At first we adopt approach B and a simple information-theoretic measure – mutual information \(M(y_P,y_Q)\) – for detecting the degree of coupling between the two components after one transition step from the uniform distribution of all global states. Then we consider an asymptotic version \(M(y_P^*,y_Q^*)\) of mutual information, somehow mixing methods A and B, and illustrate a technique for obtaining accurate approximations of \(M(y_P^*,y_Q^*)\) based on the attractors of the global graph.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
Among other things, I am particularly grateful to Stefania for having offered me to replace her for several years in teaching Software Engineering at the Engineering Dept. of the University of Siena.
- 2.
This limitation on node in-degree is not essential; we adopt it only for convenience of implementation and notation.
- 3.
Note that the graph is not sufficient for correctly identifying the order of function arguments: this is disambiguated in F.
- 4.
The averaged plot in Fig. 1-right suffers from a slight asymmetry. We conjecture that this corresponds to an asymmetry in the bool-net construction procedure: in the initial bipartite net each node has incoming edges from k distinct from-nodes while in the creation of new edges that cross between P and Q this concern is dropped and multiple edges between the same two nodes may appear, with boolean functions possibly reading duplicated arguments. The validity of the subsequent propositions is not affected by this asymmetry.
References
Balduzzi, D., Tononi, G.: Integrated information in discrete dynamical systems: motivation and theoretical framework. PLoS Comput. Biol. 4(6), e1000091 (2008)
Bolognesi, T.: LOTOS-like composition of Boolean nets and causal set construction. In: Katoen, J.-P., Langerak, R., Rensink, A. (eds.) ModelEd, TestEd, TrustEd - Essays Dedicated to Ed Brinksma on the Occasion of His 60th Birthday. LNCS, vol. 10500, pp. 27–47. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68270-9_2
Bolognesi, T.: Mutual information between Boolean net regions. The Wolfram Demonstrations Project (2018). https://demonstrations.wolfram.com/MutualInformationBetweenBooleanNetRegions/
Bolognesi, T., Brinksma, E.: Introduction to the ISO specification language LOTOS. Comput. Netw. ISDN Syst. 14, 25–59 (1987)
Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn. Wiley (2006)
Kauffman, S.A.: Homeostasis and differentiation in random genetic control networks. Nature 224, 177–178 (1969)
Oizumi, M., Albantakis, L., Tononi, G.: From the Phenomenology to the mechanisms of consciousness: integrated information theory 3.0. PLoS Comput. Biol. 10(5), e1003588 (2014)
Pearl, J.: Causality: Models, Reasoning and Inference, vol. 29. Cambridge University Press, Cambridge (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Bolognesi, T. (2019). Single-Step and Asymptotic Mutual Information in Bipartite Boolean Nets. In: ter Beek, M., Fantechi, A., Semini, L. (eds) From Software Engineering to Formal Methods and Tools, and Back. Lecture Notes in Computer Science(), vol 11865. Springer, Cham. https://doi.org/10.1007/978-3-030-30985-5_30
Download citation
DOI: https://doi.org/10.1007/978-3-030-30985-5_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-30984-8
Online ISBN: 978-3-030-30985-5
eBook Packages: Computer ScienceComputer Science (R0)