Tommaso Bolognesi
University of Twente
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Tommaso Bolognesi.
Computer Networks and Isdn Systems | 1987
Tommaso Bolognesi; Ed Brinksma
LOTOS is a specification language that has been specifically developed for the formal description of the OSI (Open Systems Interconnection) architecture, although it is applicable to distributed, concurrent systems in general. In LOTOS a system is seen as a set of processes which interact and exchange data with each other and with their environment. LOTOS is expected to become an ISO international standard by 1988.
formal methods | 1998
Joost-Pieter Katoen; Rom Langerak; Ed Brinksma; Diego Latella; Tommaso Bolognesi
This paper discusses a timed variant of a process algebra akin to LOTOS, baptized UPA, in a causality-based setting. Two timed features are incorporated—a delay function which constrains the occurrence time of atomic actions and an urgency operator that forces (local or synchronized) actions to happen urgently. Timeouts are typical urgent phenomena. A novel timed extension of event structures is introduced and used as a vehicle to provide a denotational causality-based semantics for UPA. Recursion is dealt with by using standard fixpoint theory. In addition, an operational semantics is presented based on separate time- and action-transitions that is shown to be consistent with the event structure semantics. An interleaving semantics for UPA is immediately obtained from the operational semantics. By adopting this dual approach the well-developed timed interleaving view is extended with a consistent timed partial order view and a comparison is facilitated of the partial order model and the variety of existing (interleaved) timed process algebras.
Archive | 1995
Tommaso Bolognesi; David de Frutos; Rom Langerak; Diego Latella
The Lotosphere methodology is meant to support system designers and implementors along the trajectory from an initial, abstract specification, down to concrete design and implementation: the latter should be obtained from the former via a disciplined sequence of transformation and refinement steps.
Computer Networks and Isdn Systems | 1994
Tommaso Bolognesi; Elie Najm; Paul A. J. Tilanus
Abstract This paper introduces G-LOTOS, a graphical language for the formal specification of concurrent systems. More precisely, G-LOTOS is a graphical syntax for the Formal Description Technique LOTOS, which is an ISO international standard. This paper requires no familiarity with LOTOS and can also be used as a first approach to the language. G-LOTOS is intended to provide a better readability and more intuitive understanding of formal specifications than textual LOTOS, and is itself being standardised in a joint ISO/CCITT effort. The introduction to the graphical syntax is supported by several short examples, by a complete G-LOTOS specification, and by a LOTOS/G-LOTOS conversion table.
Computer Networks and Isdn Systems | 1991
Tommaso Bolognesi; Olof Hagsand; Diego Latella; Björn Pehrson
Abstract We present a prototype implementation of a graphical editor for a subset of G-LOTOS. The graphical G-LOTOS syntax is being standardized within ISO for the LOTOS specification language. First, we provide a formal definition of the G-LOTOS subset. Then, the specification of the editor is derived from this formal definition. Finally, such a specification is used for the automatic generation of the editor by means of the LOGGIE meta-tool.
Archive | 2000
Tommaso Bolognesi; Diego Latella
This paper describes the fonnal verification of a fault-tolerant group membership algorithm that constitutes one of the central services of the Time-Triggered Protocol (TTP). The group membership algorithm is formally specified and verified using a diagrammatic representation of the algorithm. We describe the stepwise development of the diagram and outline the main part of the correctness proof. The verification has been mechanically checked with the PVS theorem prover.
formal techniques for (networked and) distributed systems | 2004
Tommaso Bolognesi
Event-based process algebraic specification languages support an elegant specification technique by which system behaviours are described as compositions of constraints on event occurrences and event parameters. This paper investigates the possibility to export this specification paradigm to a state-based formalism, and discusses some deriving advantages in terms of verification.
TAPSOFT '91 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advances in Distributed Computing (ADC) and Colloquium on Combining Paradigms for Software Developmemnt (CCPSD) | 1991
Tommaso Bolognesi; Diego Latella; Elisabetta Zuppa
Non-standard interpretations of LOTOS specifications are proposed as a most convenient and conservative way to extend the expressivity of the language without affecting its standard syntax and transition-system-based semantics. Some simple non-standard interpretations, alse called view functions, are introduced. Two different styles of formal definition are adopted (denotational and operational) for providing, respectively, a refinement of the standard LOTOS process functionality parameter, and a new parameter measuring the degree of synchronization exhibited by a specification.
Archive | 2000
Tommaso Bolognesi; Diego Latella
Erratum to: Tommaso Bolognesi and Diego Latella (Eds.) Formal Methods for Distributed System Development DOI: 10.1007/978-0-387-35533-7
formal techniques for (networked and) distributed systems | 2000
Testing Protocol Specification; Tommaso Bolognesi; Diego Latella