On the Analysis of Time-Dependent Protocols by Network Flow Algorithms. - Tommaso Bolognesi; Harry Rudin (PSTV, 1984)

Fundamental Results for the Verification of Observational Equivalence: A Survey. - Tommaso Bolognesi; Scott A. Smolka (PSTV, 1987)

Introduction to the ISO Specification Language LOTOS. - Tommaso Bolognesi; Ed Brinksma (Comput. Networks, 1987)

Squiggles - A Tool for the Analysis of LOTOS Specifications. - Tommaso Bolognesi; Maurizio Caneve (FORTE, 1988)

Techniques for the formal definition of the G-LOTOS syntax. - Tommaso Bolognesi; Diego Latella (VL, 1989)

On the soundness of graphical representations of interconnected processes in LOTOS. - Tommaso Bolognesi (Formal Methods in Software Development, 1990)

Graphical Composition Theorems for Parallel and Hiding Operators. - Tommaso Bolognesi; David de Frutos-Escrig; Yolanda Ortega-Mallén (FORTE, 1990)

A Graphical Composition Theorem for Networks of Lotos Processes. - Tommaso Bolognesi (ICDCS, 1990)

From timed Petri nets to timed LOTOS. - Tommaso Bolognesi; Ferdinando Lucidi; Sebastiano Trigila (PSTV, 1990)

LOTOS-like Process Algebras with Urgent or Timed Interactions. - Tommaso Bolognesi; Ferdinando Lucidi (FORTE, 1991)

Timed Process Algebras with Urgent Interactions and a Unique Powerful Binary Operator. - Tommaso Bolognesi; Ferdinando Lucidi (REX Workshop, 1991)

Non-standard Interpretations of LOTOS Specifications. - Tommaso Bolognesi; Diego Latella; Elisabetta Zuppa (TAPSOFT, Vol.2, 1991)

The Definition of a Graphical G-LOTOS Editor Using the Meta-Tool LOGGIE. - Tommaso Bolognesi; Olof Hagsand; Diego Latella; Björn Pehrson (Comput. Networks ISDN Syst., 1991)

The electric power of LOTOS - Results of a joint academic/industrial experiment. - Tommaso Bolognesi (FORTE, 1992)

Cumulating constraints on the "WHEN" and the "WHAT". - Tommaso Bolognesi; Giuseppe Ciaccio (FORTE, 1993)

Deriving Graphical Representations of Process Networks from Algebraic Expressions. - Tommaso Bolognesi (Inf. Process. Lett., 1993)

G-LOTOS: A Graphical Language for Concurrent Systems. - Tommaso Bolognesi; Elie Najm; Paul A. J. Tilanus (Comput. Networks ISDN Syst., 1994)

Regrouping Parallel Processes. - Tommaso Bolognesi (Formal Methods Syst. Des., 1996)

Expressive Flexibility of a Constraint-Oriented Notation. - Tommaso Bolognesi (Comput. J., 1997)

A Consistent Causality-Based View on a Timed Process Algebra Including Urgent Interactions. - Joost-Pieter Katoen; Rom Langerak; Ed Brinksma; Diego Latella; Tommaso Bolognesi (Formal Methods Syst. Des., 1998)

Constraint-oriented style for object-oriented formal specification. - Tommaso Bolognesi; John Derrick (IEE Proc. Softw., 1998)

A Layer on Top of Prolog for Composing Behavioural Constraints. - Tommaso Bolognesi; Franco Accordino (Softw. Pract. Exp., 1998)

Formal specification of discrete systems by active predicates and dynamic constraints (Short Paper). - Tommaso Bolognesi; Andrea Bracciali (FMOODS, 1999)

Toward Constraint-Object-Oriented Development. - Tommaso Bolognesi (IEEE Trans. Software Eng., 2000)

What happens? On notions of event in formal methods and elsewhere. - Tommaso Bolognesi (OPODIS, 2002)

Abstract State Processes. - Tommaso Bolognesi; Egon Börger (Abstract State Machines, 2003)

Remarks on Turbo ASMs for Functional Equations and Recursion Schemes. - Egon Börger; Tommaso Bolognesi (Abstract State Machines, 2003)

Composing Event Constraints in State-Based Specification. - Tommaso Bolognesi (FORTE, 2004)

A Conceptual Framework for State-Based and Event-Based Formal Behavioural Specification Languages. - Tommaso Bolognesi (ICECCS, 2004)

Process Algebra Under the Light of Wolfram's NKS. - Tommaso Bolognesi (APC 25, 2005)

Introduction. - Tommaso Bolognesi; John Derrick (Softw. Syst. Model., 2005)

Planar Trivalent Network Computation. - Tommaso Bolognesi (MCU, 2007)

Behavioral complexity indicators for process algebra: The NKS approach. - Tommaso Bolognesi (J. Log. Algebraic Methods Program., 2007)

Planar Trinet Dynamics with Two Rewrite Rules. - Tommaso Bolognesi (Complex Syst., 2008)

Predicates for state changes vs. processes for event patterns. - Tommaso Bolognesi (Stud. Inform. Univ., 2008)

A pseudo-random network mobile automaton with linear growth. - Tommaso Bolognesi (Inf. Process. Lett., 2009)

Buiding Discrete Spacetimes by Simple Deterministic Computations. - Tommaso Bolognesi (ERCIM News, 2010)

Causal Sets from Simple Models of Computation. - Tommaso Bolognesi (Int. J. Unconv. Comput., 2010)

Nominal Cellular Automata. - Tommaso Bolognesi; Vincenzo Ciancia (ICE, 2016)

LOTOS-Like Composition of Boolean Nets and Causal Set Construction. - Tommaso Bolognesi (ModelEd, TestEd, TrustEd, 2017)

Exploring nominal cellular automata. - Tommaso Bolognesi; Vincenzo Ciancia (J. Log. Algebraic Methods Program., 2017)

Single-Step and Asymptotic Mutual Information in Bipartite Boolean Nets. - Tommaso Bolognesi (From Software Engineering to Formal Methods and Tools, and Back, 2019)

Integrated Information in Process-Algebraic Compositions. - Tommaso Bolognesi (Entropy, 2019)