CV

Born in Ferrara, Italy, October 26,1952

Education

  • M.S. in Computer Science, Univ. of Illinois at Urbana-Champaign, 1982. Thesis: ‘A Channel Routing Algorithm Bounding Channel Width and Maximum Wire Length’ – Donna Brown.
  • Laurea in Physics (‘cum laude’), Univ. Pavia  – Collegio Ghislieri http://www.ghislieri.it/,  1976. Thesis: ‘Misure di entropia in flussi discreti’ (‘Entropy measurements in discrete streams’) – E. Gagliardo, C. Jacoboni.

Positions

Jul.02 – present

Senior researcher at CNR (Italian National Research Council) /  ISTI (Istituto di Scienza e Tecnologie    dell’Informazione“A. Faedo” – http://www.isti.cnr.it/ / Group ‘Formal Methods and Tools’ http://fmt.isti.cnr.it/.

Dec.00 – Mar.06

External Professor (‘a contratto’) of Software Engineering at the Univ. of Siena, Faculty of Engineering.

Feb.96 – Jun.02

Senior researcher at CNR/IEI (Istituto Elaborazione Informazione) at Pisa – Group ‘Models and methods for software systems’.

May.83 – Apr.84

Visiting scientist at IBM Zurich Research Laboratory (Harry Rudin) http://www.zurich.ibm.com/.

Jun.82 – Jan.96

Researcher at the Distributed Systems and Networks Dept. of CNR/CNUCE Institute (Luciano Lenzini).

Aug.81 – Aug.82

Research assistant, group ‘Applied Theoretical Computer Science’ (F. P. Preparata), at Coordinated Science Laboratory, Univ. of Illinois at Urbana-Champaign.

Aug.80 – Jun.81

Fulbright scholarship at Univ. of Illinois at Urbana-Champaign.

Jan. 77 – Aug. 80

CNR scholarship at Musicology Dept. of CNR/CNUCE Institute at Pisa (M.tro Pietro Grossi).

Research areas

•Computer-music composition based on stochastic processes, notably 1/f noise. Experiments with self-similar music composition.

•State-based automated analysis techniques for communication protocols and distributed systems.

•Definition of process-algebraic formal specification language LOTOS (ISO Standard 8807). Structural Operational Semantics of LOTOS: axioms and inference rules for labelled transition systems. Graphical syntax for LOTOS; timed extensions of LOTOS and process algebras.

•Verification techniques and tools for LOTOS; correctness-preserving transformations for process-algebraic specifications, both in textual and graphical forms.

•Formal specification styles based on composition of behavioural constraints; applications to LOTOS, Prolog, and to Object-Oriented languages.

•Integration of state-based and event-based formal, behavioural specification languages and styles: definition of a constraint-oriented notation (‘co-notation’); integration of Gurevich-Boerger’s Abstract State Machines and process-algebraic operators; exporting process-oriented / event-oriented specification style to Lamport’s state-based formal specification language TLA+.

•Detection of expressiveness and behavioural complexity for sets of process algebraic operators, using Wolfram’s NKS approach (enumeration, visual complexity indicators, exhaustive analysis by computer experiments).

•Emergence in trivalent network computations. Simple computational models of spacetime.  (Part of these activities has been carried out during the NKS Summer Schools 2005 http://www.wolframscience.com/summerschool/2005/participants/  and 2007 http://www.wolframscience.com/summerschool/2007/participants/)

Projects

•Primary promotor and coordinator of the italian participation to European Project ESPRIT-LotoSphere (1989-92) on the development of software engineering techniques and tools for LOTOS, task manager in the project, co-chair of closing conference. http://cordis.europa.eu/search/index.cfm?fuseaction=proj.simpledocument&PJ_RCN=292092&CFID=2070738&CFTOKEN=46352432

•Contributor to European projects on Formal Methods and verification techniques: ESPRIT Project SEDOS http://www.elsevier.com/wps/find/bookdescription.librarians/502097/description#description , http://cordis.europa.eu/search/index.cfm?fuseaction=proj.simpledocument&PJ_RCN=292100&CFID=2070738&CFTOKEN=46352432 , European Action Cost 247.

•Proposer and coordinator of Italian CNR Projects ‘ForteForma’ (1999) and  ‘DimmiBene’ (2001-03) on formal techniques for user manuals, and contributor to other national projects on verification.

* Coordinator of local (Tuscany) project ‘ Saperitivi Scientifici in Toscana’ for the diffusion of scientific culture (2008-2009).

Teaching, supervision, divulgation

External Professor of Software Engineering at Univ. of Pisa (1990-93) and at the Univ. of Siena (2000-2006).  Seminars and invited talks at various conferences, on topics related to formal specification languages.  Supervisor for CNR grants and theses at Univ. of Pisa.  Divulgative talks on Wolfram’s NKS (since 2005: CNR Pisa, Univ. of Siena, Univ. Trento, Univ. Pisa, Univ. Roma Tre).

Conferences, editorial activities

General chair and Programme Committe co-chair of IFIP-WG6.1 international conference FORTE-PSTV 2000 http://www.sigmod.org/sigmod/dblp/db/conf/forte/forte2000.html.  Member elected (2004-07) of the Steering Committee of IFIP International Conference FORTE.  PC member of various international conferences (PSTV, FORTE, AQuIS, SEFM, ATVA, ICFEM). Workshops chair for FM’03 http://fme03.isti.cnr.it/. Organiser of satellite workshops (FM-Elsewhere @ FORTE-PSTV 2000 http://www.cs.kent.ac.uk/people/staff/hb5/Elsewhere/, St.Eve @ FM 2003 http://fme03.isti.cnr.it/SteveHomePage.html).  Co-editor of conference proceedings (FORTE-PSTV 2000) and LotoSphere project book (1992). Guest editor and referee for various scientific journals and conferences.

Ten selected publications

(only top page ‘Publications’ is updated regularly)

  1. T. Bolognesi, ‘Automatic Composition: Experiments with Selfsimilar Music’, Computer Music Journal, Vol. 7, N.1, M.I.T. Press, Spring 1983. http://www.omf.paris4.sorbonne.fr/EARS-MINT/PERIODIC01_MINT/CMJ1-12.htm
  2. T. Bolognesi, E. Brinksma (invited paper), “Introduction to the ISO Specification Language LOTOS”, Computer Networks and ISDN Systems, Vol. 14, No. 1, North-Holland, 1987, pp. 25-59. Google Scholar: 1066 citations; CiteSeer: 407 citations http://lotos.csi.uottawa.ca/ftp/pub/Lotos/Intro/BB-LotosTutorial.pdf
  3. T. Bolognesi, “Deriving graphical representations of process networks from algebraic expressions”,  Information Processing Letters, 46, Elsevier, 1993, pp.289-294. http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html
  4. T. Bolognesi, “Regrouping Parallel Processes”, Formal Methods in System Design –  9, Kluwer Academic Publ., 1996, pp. 263-302. http://www.springerlink.com/content/q10660172j59h382/
  5. T. Bolognesi, ‘Towards Constraint-Object-Oriented development’, IEEE Trans. Software Engineering, Vol. 26, No. 7, July 2000, pp. 594-616. http://portal.acm.org/citation.cfm?id=347493
  6. T. Bolognesi (invited talk-paper), ‘Composing Event Constraints in State-based Specification’, Proceedings of 24th IFIP WG 6.1 International Conference for Networked and Distributed Systems – FORTE 2004 – Lecture Notes in Computer Science, 3235, Springer, 2004. http://www.springerlink.com/content/h4l9kjkxy68291jq/
  7. T. Bolognesi, ‘Planar trinet dynamics with two rewrite rules’ – accepted for publication in Journal Complex Systems – To appear in 2008.  See also Tech. Rep. CNR/ISTI 2007/016: http://puma.isti.cnr.it/download.php?doc=cnr.isti/cnr.isti/2007-TR-016/2007-TR-016.pdf
  8. T. Bolognesi, ‘Planar Trivalent Network Computation’ – in: Machines, Computations, and Universality, 5th International Conference, MCU 2007, Orleans, France, September 2007.  Lecture Notes in Computer Science (Springer), Volume 4664/2007, Pages 146-157. http://dx.doi.org/10.1007/978-3-540-74593-8_13
  9. T. Bolognesi, ‘Behavioral complexity indicators for process algebra: the NKS approach’. Journal of Logic and Algebraic Programming,  Elsevier, 2007. http://dx.doi.org/10.1016/j.jlap.2007.02.004
  10. T. Bolognesi, ‘Process Algebra Under the Light of Wolfram’s NKS’, Electronic Notes in Theoretical Computer Science, Volume 162, 29 September 2006, Pages 101-105. http://dx.doi.org/10.1016/j.entcs.2005.12.106 .

Publications

(only top page ‘Publications’ is updated regularly)

Google scholar: http://scholar.google.it/scholar?q=Tommaso+Bolognesi&hl=en&lr=&btnG=Search

Springerlink:     http://www.springerlink.com/content/?k=Tommaso+Bolognesi

DBLP Bibliography server: http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/b/Bolognesi:Tommaso.html

Journals

  1. T. Bolognesi, G. De Poli, G. Haus, “The Fourth Colloquium on Musical Informatics”, Interface, Vol 10, N. 3-4,  Swets & Zeitlinger B.V., Dec. 1981, pp. 245-250. http://www.omf.paris4.sorbonne.fr/EARS-MINT/PERIODIC01_MINT/INTERFACE.htm#IN1034

  2. T. Bolognesi, “Automatic Composition: Experiments with Selfsimilar Music”, Computer Music Journal, Vol. 7, N.1, M.I.T. Press, Spring 1983. http://links.jstor.org/sici?sici=0148-9267(198321)7%3A1%3C25%3AACEWSM%3E2.0.CO%3B2-C

  3. T. Bolognesi, E. Brinksma, (Invited paper): “Introduction to the ISO Specification Language LOTOS”, Computer Networks and ISDN Systems, Vol. 14, No. 1, North-Holland, 1987, pp. 25-59.  (Appeared also in book 1.) http://dx.doi.org/10.1016/0169-7552(87)90085-7

  4. T. Bolognesi, O. Hagsand, D. Latella, B. Pehrson, “The Definition of a Graphical G-LOTOS Editor Using the Meta-Tool LOGGIE”, Computer Networks and ISDN Systems, Vol. 22, No. 1, North-Holland, August 1991, pp. 61-77. http://dx.doi.org/10.1016/0169-7552(91)90082-N http://lotos.csi.uottawa.ca/ftp/pub/Lotos/Intro/BB-LotosTutorial.pdf

  5. T. Bolognesi, “Deriving graphical representations of process networks from algebraic expressions”,  Information Processing Letters, 46, Elsevier, 1993, pp.289-294. http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html

  6. T. Bolognesi, E. Najm, P. Tilanus, “G-LOTOS: a Graphical Language for Concurrent Systems”, Computer Networks and ISDN Systems, Vol. 26, N. 9, North-Holland, 1994, pp. 1101-1127.  (Appeared also in book 3 below.) http://dx.doi.org/10.1016/0169-7552(94)90014-0

  7. T. Bolognesi, F. Lucidi, S. Trigila, “Converging Towards a Timed LOTOS Standard”, Computer Standards and Interfaces, Vol. 16, North-Holland, 1994, pp. 87-118. http://dx.doi.org/10.1016/0920-5489(94)90002-7 http://portal.acm.org/citation.cfm?id=182698

  8. T. Bolognesi, “Regrouping Parallel Processes”, Formal Methods in System Design –  9, Kluwer Academic Publ., 1996, pp. 263-302. http://www.springerlink.com/content/q10660172j59h382/

  9. J.-P. Katoen, R. Langerak, E. Brinksma, D. Latella, T. Bolognesi, ‘A consistent causality-based view on a timed process algebra including urgent interactions’, Journal of Formal Methods in System Design, Vol. 12, No. 2, Kluwer Academic Publishers, 1997, pp. 189-216. http://www.ingentaconnect.com/content/klu/form/1998/00000012/00000002/00161914

  10. T. Bolognesi, ‘Expressive Flexibility of a Constraint-oriented Notation’, The Computer Journal, Vol. 40, No. 5,  Oxford Univ. Press, 1997, pp. 259-277. http://comjnl.oxfordjournals.org/cgi/content/abstract/40/5/259

  11. T. Bolognesi, J. Derrick, ‘Constraint-oriented style for object-oriented formal specification’, IEE Proceedings Software, Vol. 145, No. 2-3, IEE Publishing Dept., April-June 1998, pp. 61-69. http://portal.acm.org/citation.cfm?id=347493

  12. T. Bolognesi, F. Accordino, ‘A layer on top of Prolog for composing behavioural constraints’, Software Practice and Experience, John Wiley and Sons, Vol. 28(13), nov. 1998, pp.1415-1435. http://www3.interscience.wiley.com/cgi-bin/abstract/1770/ABSTRACT?CRETRY=1&SRETRY=0

  13. T. Bolognesi, ‘Towards Constraint-Object-Oriented development’, IEEE Trans. Software Engineering, Vol. 26, No. 7, July 2000, pp. 594-616. http://portal.acm.org/citation.cfm?id=347493

  14. T. Bolognesi – (Invited talk-paper) “Predicates for state changes vs. processes for event patterns”, Studia Informatica Universalis, Vol. 3, N. 1, (Special Issue with selection of papers from Conference OPODIS’02 – A. Bui, H. Fouchal eds.), Editions SUGER, Jan. 2004, pp. 73-104, ISBN: 2-912590-27-2. http://www.informatik.uni-trier.de/~ley/db/journals/siu/siu3.html

  15. T. Bolognesi, ‘Process Algebra Under the Light of Wolfram’s NKS’, Electronic Notes in Theoretical Computer Science, Volume 162, 29 September 2006, Pages 101-105. http://dx.doi.org/10.1016/j.entcs.2005.12.106

  16. T. Bolognesi, ‘Behavioral complexity indicators for process algebra: the NKS approach’. Journal of Logic and Algebraic Programming, Volume 72, Issue 1, May-June 2007, Pages 50-77, Elsevier, 2007. http://dx.doi.org/10.1016/j.jlap.2007.02.004.

  17. T. Bolognesi, ‘Planar trinet dynamics with two rewrite rules’ – accepted for publication in Journal Complex Systems – To appear in 2008.  See also Tech. Rep. CNR/ISTI 2007/016: http://puma.isti.cnr.it/download.php?doc=cnr.isti/cnr.isti/2007-TR-016/2007-TR-016.pdf

Books – editor or chapter author

  1. T. Bolognesi, E. Brinksma, “Introduction to the ISO Specification Language LOTOS”, in: P. H. J. van Eijk, C. A. Vissers, M. Diaz (editors), The Formal Description Technique LOTOS — Results of the ESPRIT/SEDOS Project, North-Holland, 1989, pp. 23-73. ISBN 0-444 87267 1. (Appeared also in journal 3.) . http://www.elsevier.com/wps/find/bookdescription.librarians/502097/description#description

  2. T. Bolognesi, M. Caneve, “Equivalence Verification: Theory, Algorithms, and a Tool”, in: P. H. J. van Eijk, C. A. Vissers, M. Diaz (editors), The Formal Description Technique LOTOS — Results of the ESPRIT/SEDOS Project, pp. 303-326, North-Holland, 1989, ISBN 0-444 87267 1. http://www.elsevier.com/wps/find/bookdescription.librarians/502097/description#description

  3. T. Bolognesi, J. v.d.Lagemaat, C. A. Vissers (editors), LotoSphere – Software Development using LOTOS., Kluwer Academic Publishers 1995, ISBN 0-7923-9529-8.  http://portal.acm.org/citation.cfm?id=555644 .    http://www.ecampus.com/book/0792395298

  4. T. Bolognesi, D. De Frutos, R. Langerak, D. Latella, “Correctness preserving transformations for the early phases of software development”. Chapter 8 of book 3.

  5. T. Bolognesi, M. Caneve, E. Salvatori, “GLOW 3.0 – A Graphical LOTOS Browser”, Chapter 21 of book 3.

  6. T. Bolognesi, F. Lucidi, “A Timed Full LOTOS with Time/Action Tree Semantics”, Chapter 8 of: T. Rus, C. Rattray (editors), Theories and Experiences for Real-Time System Development,  AMAST Series in Computing, Vol. 2, World Scientific Publishing Co., Inc., New Jersey – London – Singapore, 1994, ISBN 981-02-1923-7. http://portal.acm.org/citation.cfm?id=207907

  7. T. Bolognesi, “Constraint-oriented specification style for time-dependent behaviors”, Chapter 8 of: D. Mandrioli e C. Heitmeyer (editors), Formal Methods in Real-Time Systems, series Trends in Software Engineering-, (Series editor: Balchander Krishnamurthy – AT&T Bell Labs.) J. Wiley & Sons, Ltd., 1996, ISBN 0-471-95835-2. http://portal.acm.org/citation.cfm?id=547318&coll=GUIDE&dl=GUIDE&CFID=9391416&CFTOKEN=14199561

  8. T. Bolognesi, D. Latella (editors), Formal Methods for Distributed System Development, Proceedings of IFIP WG6.1 International Conference FORTE/PSTV 2000), Kluwer Academic Publishers, October 2000, ISBN 0-7923-7968-3 http://www.ecampus.com/book/0792379683

Conference proceedings

  1. T. Bolognesi, H. Rudin, “On the Analysis of Time-dependent Protocols by Network-flow Algorithms”, in: Y. Yemini, R. Strom, S. Yemini (editors), Proceedings of the IFIP WG6.1 Fourth International Workshop on Protocol Specification, Testing and Verification, North-Holland, 1985, pp. 491-513. http://www.sigmod.org/dblp/db/conf/pstv/pstv1984.html

  2. T. Bolognesi, S. A. Smolka,  “Fundamental Results for the Verification of Observational Equivalence: a Survey”, in: H. Rudin, C. West (editors), Proceedings of the IFIP WG 6.1 Seventh International Conference on Protocol Specification, Testing, and Verification, North- Holland, 1987, pp. 165-179. http://portal.acm.org/citation.cfm?id=645831.670089

  3. T. Bolognesi, D. Latella, A, Pisano, “Towards a Graphic Syntax for LOTOS”,  in: R. Speth (Editor), Research into Networks and Distributed Applications – Proceedings of EUTECO ’88 – European Teleinformatics Conference on Research into Networks and Distributed Applications, North-Holland, 1988, pp. 973-987.

  4. T. Bolognesi, M. Caneve, “Squiggles: A Tool for the Analysis of LOTOS Specifications”, in: K. J. Turner (editor), Proceedings of the First International Conference on Formal Description Techniques – FORTE’88, North-Holland, 1989, pp. 201-216. http://www.elsevier.com/wps/find/bookdescription.librarians/502089/description#description

  5. T. Bolognesi, D. Latella, “Techniques for the Formal Definition of the G-LOTOS Syntax”, Proceedings of the 1989 IEEE Workshop on Visual Languages, pp. 43-49, IEEE Computer Society Press, 1989.

  6. T. Bolognesi, “On the Soundness of Graphical Representations of Interconnected Processes in LOTOS”, in M. Moriconi (editor), Proceedings of the ACM SIGSOFT International Workshop on Formal Methods in Software Development, ACM Software Engineering Notes, Vol. 15, No. 4, ACM PRESS, Sept. 1990. http://portal.acm.org/citation.cfm?doid=99571.99574

  7. T. Bolognesi,  “A Graphical Composition Theorem for Networks of LOTOS Processes”, Proceedings of the 10th International Conference on Distributed Computing Systems (ICDCS-10, IEEE Computer Society Press, 1990), pp. 88-95. http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=89288

  8. T. Bolognesi, F. Lucidi, S. Trigila, “From Timed Petri Nets to Timed LOTOS”, in: L. Logrippo, R. L. Probert, H. Ural (editors), Proceedings of the IFIP WG6.1 Tenth International Symposium on Protocol Specification, Testing, and Verification, North-Holland, 1990, pp. 395-408. http://www.elsevier.com/wps/find/bookdescription.librarians/504643/description#description

  9. T. Bolognesi, D. Latella, E. Zuppa, “Non-standard interpretations of LOTOS specifications”, Lecture Notes in Computer Science, N. 494, S. Abramsky, T. S. E. Maibaum (editors), Proceedings of TAPSOFT’91, International Joint Conference on Theory and Practice of Software Development, Springer-Verlag,  1991, pp. 217-231. http://dx.doi.org/10.1007/3540539816_69 http://portal.acm.org/citation.cfm?id=112313&coll=GUIDE&dl=GUIDE&CFID=46570504&CFTOKEN=39458967

  10. T. Bolognesi, D. De Frutos, Y. Ortega-Mallen, “Graphical Composition Theorems for Parallel and Hiding Operators”,  in: J. Quemada, J. Manas, E. Vasquez (editors), Formal Description Techniques III, Proceedings of the IFIP WG6.1 Third International Conference on Formal Description Techniques for Distributed Systems and Communications Protocols – FORTE’90, North-Holland 1991, pp. 459-470. http://portal.acm.org/citation.cfm?id=683584

  11. T. Bolognesi, F. Lucidi, “LOTOS-like Process Algebras with Urgent or Timed Interactions”, in: K. R. Parker, G. A. Rose (editors), Formal Description Techniques IV, IFIP Transactions C-2, Proceedings of the IFIP WG6.1 Fourth International Conference on Formal Description Techniques for Distributed Systems and Communications Protocols – FORTE’91, North-Holland, 1992, pp. 249-263. http://www.informatik.uni-trier.de/~ley/db/conf/forte/forte1991.html

  12. T. Bolognesi, F. Lucidi – Invited talk-paper,  “Timed Process Algebras with Urgent Interactions and a Unique Powerful Binary Operator”, Lecture Notes in Computer Science, N. 600, J. W. De Bakker, C. Huizing, W. P. de Roever, G. Rozenberg (editors), Real-Time: Theory in Practice – REX Workshop, Springer-Verlag, 1992, pp. 124-148. http://www.springerlink.com/content/d647u1g405104412/

  13. T. Bolognesi, V. Ambriola Invited talk-paper, “The Electric Power of LOTOS”, in: M. Diaz, R. Groz (editors), Formal Description Techniques V, IFIP Transactions C-10, Proceedings of IFIP TC6/WG6.1 Fifth International Conference on Formal Description Techniques for Distributed Systems and Communications Protocols – FORTE’92, pp. 431- 446, North-Holland, 1993. http://portal.acm.org/citation.cfm?id=683767

  14. T. Bolognesi, G. Ciaccio, “Cumulating Constraints on the ‘when’ and the ‘what’”, in: R. Tenney, M. Umit Uyar, P. D. Amer (editors), Formal Description Techniques VI, IFIP Transactions C-.22 Proceedings of IFIP TC6/WG6.1 Sixth International Conference on Formal Description Techniques for Distributed Systems and Communications Protocols – FORTE’93, North-Holland, 1994. http://portal.acm.org/citation.cfm?id=681346&coll=GUIDE&dl=GUIDE&CFID=46570251&CFTOKEN=71938376

  15. J.-P. Katoen, D. Latella, R. Langerak, E. Brinksma, T. Bolognesi, “A consistent causality-based and interleaved view on a timed process algebra including timeouts”, Third AMAST Workshop on Real-Time Systems, Models, Properties and Control,  March 6-8, 1996, Salt-Lake City, Utah (USA).  Proceedings: Dan Ionescu (editor) – Technical Report Univ. Ottawa, Dept. of Electrical Engineering, 1996. http://dx.doi.org/10.1023/A:1008649927166

  16. T. Bolognesi, “Expressive flexibility in constraint-oriented specification: LOTOS and Co-notation”,  in: H. Bowman, J. Derrick (editors), Formal Methods for Open Object-based Distributed Systems, Proceedings of the Second IFIP TC6 WG6.1 International Workshop FMOODS’97, Chapman-Hall, 1997, pp. 261-276. http://portal.acm.org/citation.cfm?id=278766&coll=GUIDE&dl=GUIDE&CFID=9391416&CFTOKEN=14199561

  17. T. Bolognesi, A. Bracciali, “Formal specification of discrete systems by active predicates and dynamic constraints”,  in: P. Ciancarini, A. Fantechi, R. Gorrieri (editors), Formal Methods for Open Object-based Distributed Systems, Proceedings of the Third IFIP TC6 WG6.1 International Conference FMOODS’99, Kluwer Academic Publishers, 1999, pp. 161-169. http://portal.acm.org/citation.cfm?id=759672&coll=GUIDE&dl=GUIDE&CFID=9391416&CFTOKEN=14199561

  18. T. Bolognesi, E. Boerger – Invited talk-paper, ‘Abstract State Processes’, in:Egon Boerger, Angelo Gargantini, Elvinia Riccobene (Eds), Abstract State Machines – Advances in Theory and Applications, Proceedings of 10th International Workshop, ASM 2003, Taormina, Italy, March 2003, LNCS 2589, Springer, 2003, http://www.springerlink.com/content/npr9q3cmpl9e5hy5/?p=143a19338503469188eb81ac57d867b0&pi=7

  19. E. Boerger, T. Bolognesi, ‘Remarks on Turbo ASMs for Computing Functional Equations and Recursion Schemes’, in:Egon Boerger, Angelo Gargantini, Elvinia Riccobene (Eds), Abstract State Machines – Advances in Theory and Applications, Proceedings of 10th International Workshop, ASM 2003, Taormina, Italy, March 2003, LNCS 2589. http://www.springerlink.com/content/5x8nfjjfpn8ur3km/

  20. T. Bolognesi, ‘A Conceptual Framework for State-Based and Event-Based Formal Behavioural Specification Languages’, Proceedings of Ninth IEEE International Conference on Engineering of Complex Computer Systems (ICECCS), Florence, Italy, 14-16 April 2004, pp. 107-116, IEEE Computer Society, ISBN 0-7695-2109-6. http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/&toc=comp/proceedings/iceccs/2004/2109/00/2109toc.xml&DOI=10.1109/ICECCS.2004.1310909

  21. T. Bolognesi Invited talk-paper, ‘Composing Event Constraints in State-based Specification’, Proceedings of 24th IFIP WG 6.1 International Conference for Networked and Distributed Systems – FORTE 2004 – Lecture Notes in Computer Science, 3235, Springer, 2004.  DOI: 10.1007/b100576 . http://www.springerlink.com/content/h4l9kjkxy68291jq/

  22. T. Bolognesi, Process algebra under the light of Wolfram’s NKS. Algebraic Process Calculi: The First Twenty Five Years and Beyond, PA ’05 (Bertinoro, Forli’, Italy, August 1-5, 2005). Proceedings, Vol. NS-05-3. Luca Aceto, Andrew Gordon (eds.). BRICS Notes Series, 2005. http://www.brics.dk/NS/05/3/BRICS-NS-05-3.pdf

  23. T. Bolognesi, Planar Trivalent Network Computation – in: Machines, Computations, and Universality,, 5th International Conference, MCU 2007, Orleans, France, September 2007. Lecture Notes in Computer Science (Springer), Volume 4664/2007, Pages 146-157, ISBN 978-3-540-74592-1, DOI 10.1007/978-3-540-74593-8_13, http://www.springerlink.com/content/m624350kj28305u9/

Guest editor

  1. T. Bolognesi, J. Derrick, Special Section on St.Eve Workshop, Software and Systems Modeling, Vol. 4, N. 3, July 2005. http://www.springerlink.com/content/m302w427786u4248/

Conference talks (no published proceedings)

  1. Bolognesi, T., E. Boerger, ’Process algebraic operators for ASMs’, International Seminar ‘Theory and Applications of Abstract State Machines, International Conference and Research Center for Computer Science, Schloss Dagstuhl, Wadern, Germany Dagstuhl, Germany, March 3-8, 2002 – Organizzatori: A. Blass (Univ. of Michigan, USA), E. Börger (Univ. di Pisa, Italia), Y. Gurevich (Microsoft Research, Redmond, USA)
  2. T. Bolognesi, ‘Detecting and measuring randomness in process-algebraic computations’, NKS 2006, Brown Univ., June 16-18, 2006 – http://www.wolframscience.com/conference/2006/presentations/bolognesi.html
  3. T. Bolognesi, ‘Perturbed planar trinet computations with two rewrite rules’, NKS 2007, Univ. Vermont at Burlington, July 13-15, 2007 – http://www.wolframscience.com/conference/2007/presentations/

Journals – in italian

  1. G. Bertini, T. Bolognesi, P. Grossi, “TAU2-TAUMUS: il sistema di computer music in tempo reale realizzato a Pisa”, Automazione e strumentazione, Vol. XXVIII, N.2, pp. 135-143, Febbr. 1980.

  2. T. Bolognesi,  “Composizione automatica: esperimenti di musica autosimile”, L’elaborazione automatica, Vol 3. N.4, Ott. 1980.

  3. T. Bolognesi, A. Casini, G. Castellini, “Sintesi dei suoni ed elaborazione di strutture musicali”, Informatica, Vol. 1, N. 2, 1980.

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

Leave a Reply

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

WordPress.com Logo

You are commenting using your WordPress.com 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 )

Google+ photo

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

Connecting to %s