 | 2009 |
| 34 |  | Tommaso Bolognesi:
A pseudo-random network mobile automaton with linear growth.
Inf. Process. Lett. 109(13): 668-674 (2009) |
| 2007 |
| 33 |  | Tommaso Bolognesi:
Planar Trivalent Network Computation.
MCU 2007: 146-157 |
| 32 |  | Tommaso Bolognesi:
Behavioral complexity indicators for process algebra: The NKS approach.
J. Log. Algebr. Program. 72(1): 50-77 (2007) |
| 2006 |
| 31 |  | Tommaso Bolognesi:
Process Algebra Under the Light of Wolfram's NKS.
Electr. Notes Theor. Comput. Sci. 162: 101-105 (2006) |
| 2005 |
| 30 |  | Tommaso Bolognesi,
John Derrick:
Introduction.
Software and System Modeling 4(3): 234-235 (2005) |
| 2004 |
| 29 |  | Tommaso Bolognesi:
Composing Event Constraints in State-Based Specification.
FORTE 2004: 13-32 |
| 28 |  | Tommaso Bolognesi:
A Conceptual Framework for State-Based and Event-Based Formal Behavioural Specification Languages.
ICECCS 2004: 107-116 |
| 27 |  | Tommaso Bolognesi:
Predicates for state changes vs. processes for event patterns.
Stud. Inform. Univ. 3(1): 85-124 (2004) |
| 2003 |
| 26 |  | Egon Börger,
Tommaso Bolognesi:
Remarks on Turbo ASMs for Functional Equations and Recursion Schemes.
Abstract State Machines 2003: 218-228 |
| 25 |  | Tommaso Bolognesi,
Egon Börger:
Abstract State Processes.
Abstract State Machines 2003: 22-32 |
| 2002 |
| 24 |  | Tommaso Bolognesi:
What happens? On notions of event in formal methods and elsewhere.
OPODIS 2002: 1-3 |
| 2000 |
| 23 |  | Tommaso Bolognesi,
Diego Latella:
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
Kluwer 2000 |
| 22 |  | Tommaso Bolognesi:
Toward Constraint-Object-Oriented Development.
IEEE Trans. Software Eng. 26(7): 594-616 (2000) |
| 1999 |
| 21 |  | Tommaso Bolognesi,
Andrea Bracciali:
Formal specification of discrete systems by active predicates and dynamic constraints (Short Paper).
FMOODS 1999 |
| 1998 |
| 20 |  | 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 in System Design 12(2): 189-216 (1998) |
| 19 |  | Tommaso Bolognesi,
John Derrick:
Constraint-oriented style for object-oriented formal specification.
IEE Proceedings - Software 145(2-3): 61-70 (1998) |
| 18 |  | Tommaso Bolognesi,
Franco Accordino:
A Layer on Top of Prolog for Composing Behavioural Constraints.
Softw., Pract. Exper. 28(13): 1415-1435 (1998) |
| 1997 |
| 17 |  | Tommaso Bolognesi:
Expressive Flexibility of a Constraint-Oriented Notation.
Comput. J. 40(5): 277-259 (1997) |
| 1996 |
| 16 |  | Tommaso Bolognesi:
Regrouping Parallel Processes.
Formal Methods in System Design 9(3): 263-302 (1996) |
| 1994 |
| 15 |  | Tommaso Bolognesi,
Elie Najm,
Paul A. J. Tilanus:
G-LOTOS: A Graphical Language for Concurrent Systems.
Computer Networks and ISDN Systems 26(9): 1101-1127 (1994) |
| 1993 |
| 14 |  | Tommaso Bolognesi,
Giuseppe Ciaccio:
Cumulating constraints on the "WHEN" and the "WHAT".
FORTE 1993: 433-448 |
| 13 |  | Tommaso Bolognesi:
Deriving Graphical Representations of Process Networks from Algebraic Expressions.
Inf. Process. Lett. 46(6): 289-294 (1993) |
| 1992 |
| 12 |  | Tommaso Bolognesi:
The electric power of LOTOS - Results of a joint academic/industrial experiment.
FORTE 1992: 431-446 |
| 1991 |
| 11 |  | Tommaso Bolognesi,
Ferdinando Lucidi:
LOTOS-like Process Algebras with Urgent or Timed Interactions.
FORTE 1991: 249-264 |
| 10 |  | Tommaso Bolognesi,
Ferdinando Lucidi:
Timed Process Algebras with Urgent Interactions and a Unique Powerful Binary Operator.
REX Workshop 1991: 124-148 |
| 9 |  | Tommaso Bolognesi,
Diego Latella,
Elisabetta Zuppa:
Non-standard Interpretations of LOTOS Specifications.
TAPSOFT, Vol.2 1991: 217-234 |
| 8 |  | Tommaso Bolognesi,
Olof Hagsand,
Diego Latella,
Björn Pehrson:
The Definition of a Graphical G-LOTOS Editor Using the Meta-Tool LOGGIE.
Computer Networks and ISDN Systems 22(1): 61-77 (1991) |
| 1990 |
| 7 |  | Tommaso Bolognesi,
David de Frutos-Escrig,
Yolanda Ortega-Mallén:
Graphical Composition Theorems for Parallel and Hiding Operators.
FORTE 1990: 459-470 |
| 6 |  | Tommaso Bolognesi:
A Graphical Composition Theorem for Networks of Lotos Processes.
ICDCS 1990: 88-95 |
| 5 |  | Tommaso Bolognesi,
Ferdinando Lucidi,
Sebastiano Trigila:
From timed Petri nets to timed LOTOS.
PSTV 1990: 395-408 |
| 1988 |
| 4 |  | Tommaso Bolognesi,
Maurizio Caneve:
Squiggles - A Tool for the Analysis of LOTOS Specifications.
FORTE 1988: 201-216 |
| 1987 |
| 3 |  | Tommaso Bolognesi,
Scott A. Smolka:
Fundamental Results for the Verification of Observational Equivalence: A Survey.
PSTV 1987: 165-179 |
| 2 |  | Tommaso Bolognesi,
Ed Brinksma:
Introduction to the ISO Specification Language LOTOS.
Computer Networks 14: 25-59 (1987) |
| 1984 |
| 1 |  | Tommaso Bolognesi,
Harry Rudin:
On the Analysis of Time-Dependent Protocols by Network Flow Algorithms.
PSTV 1984: 491-513 |