Recent publications

(for older ones, see links at the bottom of the page)


—— 2017 ——

Bolognesi T., The Man in a Tailcoat, In: FQXi Essay Contest ‘Wandering Towards a Goal – How can mindless mathematical laws give rise to aims and intention’ (Dec. 2016 – March 2017). Proceedings, electronic form, Foundational Question Institute, March 2017. 4th Prize Winner.

T. Bolognesi, V. Ciancia, ‘Exploring Nominal Cellular Automata‘, Journal of Logical and Algebraic Methods in Programming, Vol. 93, Dec. 2017, pp. 23-41.  Elsevier. (available online 1 sept. 2017) doi

T. Bolognesi, LOTOS-like Composition of Boolean Nets and Causal Set Construction, In: J.-P. Katoen, R. Langerak, A. Rensik (Eds.), ModelEd, TestEd, TrustEd – Essays Dedicated to Ed Brinksma on the Occasion of His 60th Birthday, LNCS 10500 (Festchrift), pp. 27-47, Springer, ISNB 978-3-319-68269-3.


—— 2016 ——

T. Bolognesi, V. Ciancia, ‘Nominal Cellular Automata’, in M. Bartoletti, L. Henrio, S. Knight and H. Torres Vieira (eds.), Proceedings 9th Conference ‘Interaction and Concurrency Experience’ – ICE 2016 (Heraklion, Greece, 8-9 June 2016), EPTCS, Vol. 223.

Bolognesi T. and Lamb A., Simple Indicators for Lorentzian Causets, Classical and Quantum Gravity, Vol. 33, No. 18, September 22, 2016, 185004 (41 pp), IOP Publishing Ltd. doi 10.1088/0264-9381/33/18/185004

Bolognesi T., Spacetime Computing: Towards Algorithmic Causal Sets with Special-Relativistic Properties. In: A. Adamatzky (ed.), Advances in Unconventional Computing.  Vol. 22 of the Series ‘Emergence, Complexity and Computation’, pp. 267-304, Springer, July 19, 2016. Print ISBN 978-3-319-33923-8, On-line ISBN 978-3-319-33924-5.

Bolognesi T., Let’s Consider Two Spherical Chickens. In: FQXi Essay Contest 2015 – ‘Trick or Truth? The Mysterious Connection Between Physics and Mathematics’ (January  – August, 2015). Proceedings, electronic form, Foundational Question Institute, March 2015.  3th Prize Winner and special mention for ‘Most Creative Presentation’. — Appeared in Springer volume, The Frontiers Collection, 2016.


—— 2015 ——

Bolognesi, T., Node degree growth in sprinkled causets, Proceed. Mathematica Italia User Group Meeting 2015, UGM 2015 (Napoli, May 28-29, 2015) – ISBN: 978-88-96810-04-0, 2015.


—— 2014 ——

Bolognesi T., Lamb A., Simple indicators for Lorentzian causets (v2), ArXiv:1407.1649v2 [gr-qc] December 11, 2014 (CNR/ISTI Technical Report 2014-TR-077, Pisa, December 2014).

Bolognesi T., Lamb A., Simple indicators for Lorentzian causets, CNR/ISTI Technical Report 2014-TR-023, Pisa, June 2014.

Bolognesi T. ‘Teilhard de Chardin e Wolfram: modelli di universo computazionale ed emergenza del foglietto interno delle cose’. In: Studium, vol. 110 (3) pp. 340 – 360. Teilhard de Chardin, oggi e domani. Ludovico Galleni (ed.). Edizioni Studium s.r.l, 2014.

Bolognesi T. Humanity is much more than the sum of humans. In: FQXi Essay Contest 2014 – How Should Humanity Steer the Future? (January 9 – August 31, 2014). Proceedings, electronic form, Foundational Question Institute, March 27, 2014.  4th Prize Winner.  — Revision published in: A. Aguirre, B. Foster, Z. Merali (Eds.), How Should Humanity Steer the Future, Springer (The Frontiers Collection), 2016. ISBN 978-3-319-20716-2.


—— 2013 ——

Bolognesi, T., Stochastic and Algorithmic Causal Sets for de Sitter Spacetime,  “Mathematica Italia User Group Meeting 2013 – Atti del Convegno”, Bologna, 30-31 Maggio 2013, isbn 978-88-96810-03-3.

Bolognesi, T., Do Particles Evolve?, In: H. Zenil (editor), Irreducibility and Computational Equivalence 10 Years After Wolfram’s A New Kind of Science, Springer-Verlag 2013. ISBN 978-3-642-35481-6.  DOI 10.1007/978-3-642-35482-3.

Bolognesi, T., Algorithmic causal sets for a computational spacetime, chapter 23 of: H. Zenil (editor),  A Computable Universe – Understanding and Exploring Nature as Computation (Alan Turing centennial celebration).  World Scientific, 2013. ISBN 978-981-4374-29-3.


—— 2012 ——

Bolognesi, T., The live fabric of the computing universe: from Teilhard de Chardin to Wolfram, Proceedings of the meeting ‘Teilhard de Chardin and the necessity of life in the universe’, Kayser Italia, Livorno, November 23, 2012.


—— 2011 ——

Bolognesi T. Reality is ultimately digital, and its program is still undebugged. In: FQXi Essay Contest 2011 – Is Reality Digital or Analog? – 1 November – 15 March 2011). Proceedings, Foundational Question Institute, 2011. 4th Prize Winner.

Bolognesi T. Algorithmic causets. In: Journal of Physics: Conference Series, vol. 306 (1) article n. 012042. Special issue: 5th International Workshop DICE 2010 Space-Time-Matter – Current Issues in Quantum Mechanics and Beyond. Lajos Diósi, Hans-Thomas Elze, Leone Fronzoni, Jonathan Halliwell, Enrico Prati, Giuseppe Vitiello, James Yearsley (eds.). IOP Science, 2011.


—— 2010 ——

Bolognesi T. Building Discrete Spacetimes by Simple Deterministic Computations. In: ERCIM News, vol. 83 pp. 52 – 53. ERCIM EEIG, 2010.

Bolognesi T. Causal sets from simple models of computation. In: International Journal of Unconventional Computing, vol. 6 (6) pp. 489 – 524. OCP Science, 2010.  (See also


—— 2009 and before ——

Bolognesi T. A pseudo-random network mobile automaton with linear growth. In: Information Processing Letters, vol. 109 (13) pp. 668 – 674. Elsevier, 2009.

Bolognesi T. Planar Trinet Dynamics with Two Rewrite Rules. In: Complex Systems, vol. 18 (1) pp. 1 – 41. Complex Systems Publications, Inc, 2008.

Bolognesi T. Planar Trivalent Network Computation. In: 5th International Conference MCU 2007 – Machines, Computations, and Universality (Orleans – France, 10-13 september 2007). Proceedings, pp. 146 – 157. Jerome Durand-Lose, Maurice Margenstern (eds.). (Lecture Notes in Computer Science, vol. 4664). Springer, 2007.

Bolognesi T. Behavioral complexity indicators for process algebra: the NKS approach. In: Journal of Logic and Algebraic Programming, vol. 72 (1) pp. 50 – 77. Algebraic Process Calculi: The First Twenty Five Years and Beyond. II. Elsevier, 2007.

Bolognesi T.  Process algebra under the light of Wolfram’s NKS. In: Electronic Notes in Theoretical Computer Science, vol. 162 pp. 101 – 105. Workshop “Essays on Algebraic Process Calculi” – APC 25 (Bertinoro, Italy 01-05 August 2005). Proceedings. L. Aceto and A.D. Gordon (eds.). Elsevier, 2006.

Bolognesi, T. Predicates for state changes vs. processes for event patterns, Studia Informatica Universalis 3, Suger, Saint-Denis, rue Catulienne, France 2004, ISBN 2-912590-26-4

Bolognesi T. What happens? On notions of event in formal methods and elsewhere. Alain Bui, Hacène Fouchal: 6th International Conference on Principles of Distributed Systems. OPODIS 2002, Reims, France, December 11-13, 2002. (Invited talk).


Edited books

Bolognesi T., van de Lagemaat J., Vissers C, LotoSphere: Software Development with LOTOS. Kluwer Academic Publishers, ISBN 0792395298, 9780792395294.

Bolognesi T., Latella D. Formal methods for distributed system development. Proceedings of IFIP WG6.1 International Conference FORTE/PSTV 2000). Kluwer Academic Publishers, ISBN 0-7923-7968-3.


Most cited publication

T. Bolognesi, E. Brinksma, Introduction to the ISO Specification Language LOTOS, Computer Networks and ISDN Systems, 14(1), pp. 25-59, Elsevier, 1987.

See also

  1. No comments yet.
  1. No trackbacks yet.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s