Tommaso Bolognesi

Orcid: 0000-0003-0854-2587

According to our database1, Tommaso Bolognesi authored at least 43 papers between 1984 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Integrated Information in Process-Algebraic Compositions.
Entropy, 2019

Single-Step and Asymptotic Mutual Information in Bipartite Boolean Nets.
Proceedings of the From Software Engineering to Formal Methods and Tools, and Back, 2019

2017
Exploring nominal cellular automata.
J. Log. Algebraic Methods Program., 2017

LOTOS-Like Composition of Boolean Nets and Causal Set Construction.
Proceedings of the ModelEd, TestEd, TrustEd, 2017

2016
Nominal Cellular Automata.
Proceedings of the Proceedings 9th Interaction and Concurrency Experience, 2016

2010
Causal Sets from Simple Models of Computation.
Int. J. Unconv. Comput., 2010

Buiding Discrete Spacetimes by Simple Deterministic Computations.
ERCIM News, 2010

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

2008
Planar Trinet Dynamics with Two Rewrite Rules.
Complex Syst., 2008

2007
Behavioral complexity indicators for process algebra: The NKS approach.
J. Log. Algebraic Methods Program., 2007

Planar Trivalent Network Computation.
Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

2005
Introduction.
Softw. Syst. Model., 2005

Process Algebra Under the Light of Wolfram's NKS.
Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005

2004
Predicates for state changes vs. processes for event patterns.
Stud. Inform. Univ., 2004

A Conceptual Framework for State-Based and Event-Based Formal Behavioural Specification Languages.
Proceedings of the 9th International Conference on Engineering of Complex Computer Systems (ICECCS 2004), 2004

Composing Event Constraints in State-Based Specification.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2004

2003
Remarks on Turbo ASMs for Functional Equations and Recursion Schemes.
Proceedings of the Abstract State Machines, 2003

Abstract State Processes.
Proceedings of the Abstract State Machines, 2003

2002
What happens? On notions of event in formal methods and elsewhere.
Proceedings of the Procedings of the 6th International Conference on Principles of Distributed Systems. OPODIS 2002, 2002

2000
Toward Constraint-Object-Oriented Development.
IEEE Trans. Software Eng., 2000

1999
Formal specification of discrete systems by active predicates and dynamic constraints (Short Paper).
Proceedings of the Formal Methods for Open Object-Based Distributed Systems, 1999

1998
A Layer on Top of Prolog for Composing Behavioural Constraints.
Softw. Pract. Exp., 1998

Constraint-oriented style for object-oriented formal specification.
IEE Proc. Softw., 1998

A Consistent Causality-Based View on a Timed Process Algebra Including Urgent Interactions.
Formal Methods Syst. Des., 1998

1997
Expressive Flexibility of a Constraint-Oriented Notation.
Comput. J., 1997

1996
Regrouping Parallel Processes.
Formal Methods Syst. Des., 1996

1994
G-LOTOS: A Graphical Language for Concurrent Systems.
Comput. Networks ISDN Syst., 1994

1993
Deriving Graphical Representations of Process Networks from Algebraic Expressions.
Inf. Process. Lett., 1993

Cumulating constraints on the "WHEN" and the "WHAT".
Proceedings of the Formal Description Techniques, VI, Proceedings of the IFIP TC6/WG6.1 Sixth International Conference on Formal Description Techniques, 1993

1992
The electric power of LOTOS - Results of a joint academic/industrial experiment.
Proceedings of the Formal Description Techniques, 1992

1991
The Definition of a Graphical G-LOTOS Editor Using the Meta-Tool LOGGIE.
Comput. Networks ISDN Syst., 1991

Non-standard Interpretations of LOTOS Specifications.
Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991

Timed Process Algebras with Urgent Interactions and a Unique Powerful Binary Operator.
Proceedings of the Real-Time: Theory in Practice, 1991

LOTOS-like Process Algebras with Urgent or Timed Interactions.
Proceedings of the Formal Description Techniques, 1991

1990
From timed Petri nets to timed LOTOS.
Proceedings of the Protocol Specification, 1990

A Graphical Composition Theorem for Networks of Lotos Processes.
Proceedings of the 10th International Conference on Distributed Computing Systems (ICDCS 1990), May 28, 1990

Graphical Composition Theorems for Parallel and Hiding Operators.
Proceedings of the Formal Description Techniques, 1990

On the soundness of graphical representations of interconnected processes in LOTOS.
Proceedings of the Conference proceedings on Formal methods in software development, 1990

1989
Techniques for the formal definition of the G-LOTOS syntax.
Proceedings of the IEEE Workshop on Visual Languages, 1989

1988
Squiggles - A Tool for the Analysis of LOTOS Specifications.
Proceedings of the Formal Description Techniques, 1988

1987
Introduction to the ISO Specification Language LOTOS.
Comput. Networks, 1987

Fundamental Results for the Verification of Observational Equivalence: A Survey.
Proceedings of the Protocol Specification, 1987

1984
On the Analysis of Time-Dependent Protocols by Network Flow Algorithms.
Proceedings of the Protocol Specification, 1984


  Loading...