Tommaso Bolognesi

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