Tommaso Bolognesi

Publication Activity (10 Years)

Years Active: 1984-2019
Publications (10 Years): 5

Top Topics

Cellular Automata

Pattern Formation

Mutual Information

Chaotic Dynamics

Top Venues

J. Log. Algebraic Methods Program.

ModelEd, TestEd, TrustEd

Publications

Tommaso Bolognesi
Single-Step and Asymptotic Mutual Information in Bipartite Boolean Nets. From Software Engineering to Formal Methods and Tools, and Back (2019)
Tommaso Bolognesi
Integrated Information in Process-Algebraic Compositions. Entropy 21 (8) (2019)
Tommaso Bolognesi, Vincenzo Ciancia
Exploring nominal cellular automata. J. Log. Algebraic Methods Program. 93 (2017)
Tommaso Bolognesi
LOTOS-Like Composition of Boolean Nets and Causal Set Construction. ModelEd, TestEd, TrustEd (2017)
Tommaso Bolognesi, Vincenzo Ciancia
Nominal Cellular Automata. ICE (2016)
Tommaso Bolognesi
Causal Sets from Simple Models of Computation. Int. J. Unconv. Comput. 6 (6) (2010)
Tommaso Bolognesi
Buiding Discrete Spacetimes by Simple Deterministic Computations. ERCIM News 2010 (83) (2010)
Tommaso Bolognesi
Causal sets from simple models of computation CoRR (2010)
Tommaso Bolognesi
A pseudo-random network mobile automaton with linear growth. Inf. Process. Lett. 109 (13) (2009)
Tommaso Bolognesi
Predicates for state changes vs. processes for event patterns. Stud. Inform. Univ. 6 (2) (2008)
Tommaso Bolognesi
Planar Trinet Dynamics with Two Rewrite Rules. Complex Syst. 18 (1) (2008)
Tommaso Bolognesi
Planar Trivalent Network Computation. MCU (2007)
Tommaso Bolognesi
Behavioral complexity indicators for process algebra: The NKS approach. J. Log. Algebraic Methods Program. 72 (1) (2007)
Tommaso Bolognesi
Process Algebra Under the Light of Wolfram's NKS. Electron. Notes Theor. Comput. Sci. 162 (2006)
Tommaso Bolognesi, John Derrick
Introduction. Softw. Syst. Model. 4 (3) (2005)
Tommaso Bolognesi
Predicates for state changes vs. processes for event patterns. Stud. Inform. Univ. 3 (1) (2004)
Tommaso Bolognesi
Composing Event Constraints in State-Based Specification. FORTE (2004)
Tommaso Bolognesi
A Conceptual Framework for State-Based and Event-Based Formal Behavioural Specification Languages. ICECCS (2004)
Tommaso Bolognesi, Egon Börger
Abstract State Processes. Abstract State Machines (2003)
Egon Börger, Tommaso Bolognesi
Remarks on Turbo ASMs for Functional Equations and Recursion Schemes. Abstract State Machines (2003)
Tommaso Bolognesi
What happens? On notions of event in formal methods and elsewhere. OPODIS (2002)
Tommaso Bolognesi
Toward Constraint-Object-Oriented Development. IEEE Trans. Software Eng. 26 (7) (2000)
Tommaso Bolognesi, Andrea Bracciali
Formal specification of discrete systems by active predicates and dynamic constraints (Short Paper). FMOODS (1999)
Joost-Pieter Katoen, Rom Langerak, Ed Brinksma, Diego Latella, Tommaso Bolognesi
A Consistent Causality-Based View on a Timed Process Algebra Including Urgent Interactions. Formal Methods Syst. Des. 12 (2) (1998)
Tommaso Bolognesi, John Derrick
Constraint-oriented style for object-oriented formal specification. IEE Proc. Softw. 145 (2-3) (1998)
Tommaso Bolognesi, Franco Accordino
A Layer on Top of Prolog for Composing Behavioural Constraints. Softw. Pract. Exp. 28 (13) (1998)
Tommaso Bolognesi
Expressive Flexibility of a Constraint-Oriented Notation. Comput. J. 40 (5) (1997)
Tommaso Bolognesi
Regrouping Parallel Processes. Formal Methods Syst. Des. 9 (3) (1996)
Tommaso Bolognesi, Elie Najm, Paul A. J. Tilanus
G-LOTOS: A Graphical Language for Concurrent Systems. Comput. Networks ISDN Syst. 26 (9) (1994)
Tommaso Bolognesi, Giuseppe Ciaccio
Cumulating constraints on the "WHEN" and the "WHAT". FORTE (1993)
Tommaso Bolognesi
Deriving Graphical Representations of Process Networks from Algebraic Expressions. Inf. Process. Lett. 46 (6) (1993)
Tommaso Bolognesi
The electric power of LOTOS - Results of a joint academic/industrial experiment. FORTE (1992)
Tommaso Bolognesi, Ferdinando Lucidi
Timed Process Algebras with Urgent Interactions and a Unique Powerful Binary Operator. REX Workshop (1991)
Tommaso Bolognesi, Ferdinando Lucidi
LOTOS-like Process Algebras with Urgent or Timed Interactions. FORTE (1991)
Tommaso Bolognesi, Diego Latella, Elisabetta Zuppa
Non-standard Interpretations of LOTOS Specifications. TAPSOFT, Vol.2 (1991)
Tommaso Bolognesi, Olof Hagsand, Diego Latella, Björn Pehrson
The Definition of a Graphical G-LOTOS Editor Using the Meta-Tool LOGGIE. Comput. Networks ISDN Syst. 22 (1) (1991)
Tommaso Bolognesi
A Graphical Composition Theorem for Networks of Lotos Processes. ICDCS (1990)
Tommaso Bolognesi, David de Frutos-Escrig, Yolanda Ortega-Mallén
Graphical Composition Theorems for Parallel and Hiding Operators. FORTE (1990)
Tommaso Bolognesi, Ferdinando Lucidi, Sebastiano Trigila
From timed Petri nets to timed LOTOS. PSTV (1990)
Tommaso Bolognesi
On the soundness of graphical representations of interconnected processes in LOTOS. Formal Methods in Software Development (1990)
Tommaso Bolognesi, Diego Latella
Techniques for the formal definition of the G-LOTOS syntax. VL (1989)
Tommaso Bolognesi, Maurizio Caneve
Squiggles - A Tool for the Analysis of LOTOS Specifications. FORTE (1988)
Tommaso Bolognesi, Scott A. Smolka
Fundamental Results for the Verification of Observational Equivalence: A Survey. PSTV (1987)
Tommaso Bolognesi, Ed Brinksma
Introduction to the ISO Specification Language LOTOS. Comput. Networks 14 (1987)
Tommaso Bolognesi, Harry Rudin
On the Analysis of Time-Dependent Protocols by Network Flow Algorithms. PSTV (1984)