Franco Mazzanti
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Franco Mazzanti has a total of 83 co-authors. Here are the top co-authors by number of shared publications:
- Stefania Gnesi
CNR-ISTI
23 shared publications - Maurice H. ter Beek
CNR–ISTI
21 shared publications - Alessio Ferrari
University College Dublin (UCD) Ireland
10 shared publications - Davide Basile
Formal Methods and Tools lab, CNR–ISTI
8 shared publications Alessandro Fantechi
Università degli Studi di Firenze, Italy
4 shared publications- Alessandro Fantechi
DINFO - Università degli Studi di Firenze
4 shared publications
Latest Publications
- 6 February 2026
- Published by Springer Nature
- p. 31-54
Formal Methods for Railway Systems: A Survey of Research and Technology Transfer Projects
- 6 February 2026
- Published by Springer Nature
- p. 31-54
Formal Methods for Railway Systems: A Survey of Research and Technology Transfer Projects
- 16 November 2025
- Published by Springer Nature
- p. 135-154
Comparing Model Checking and Model-Based Simulation
- 16 November 2025
- Published by Springer Nature
- p. 135-154
Comparing Model Checking and Model-Based Simulation
- 17 September 2023
- Published by Springer Nature
- p. 1-21
Experimenting with Formal Verification and Model-Based Development in Railways: The Case of UMC and Sparx Enterprise Architect
- 17 September 2023
- Published by Springer Nature
- p. 1-21
Experimenting with Formal Verification and Model-Based Development in Railways: The Case of UMC and Sparx Enterprise Architect
- 11 February 2023
- Published by Springer Nature
- p. 164-173
A Case Study in Formal Analysis of System Requirements
- 11 February 2023
- Published by Springer Nature
- p. 164-173
A Case Study in Formal Analysis of System Requirements
- 27 September 2022
- Published by Elsevier in Science of Computer Programming
- Vol. 224
FTS4VMC: A front-end tool for static analysis and family-based model checking of FTSs with VMC
- 27 September 2022
- Published by Elsevier in Science of Computer Programming
- Vol. 224
FTS4VMC: A front-end tool for static analysis and family-based model checking of FTSs with VMC
- 2 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 48 (11) , 4675-4691
Systematic Evaluation and Usability Analysis of Formal Methods Tools for Railway Signaling System Design
Formal methods and supporting tools have a long record of success in the development of safety-critical systems. However, no single tool has emerged as the dominant solution for system design. Each tool differs from the others in terms of the modeling language used, its verification capabilities and other complementary features, and each development context has peculiar needs that require different tools. This is particularly problematic for the railway industry, in which formal methods are highly recommended by the norms, but no actual guidance is provided for the selection of tools. To guide companies in the selection of the most appropriate formal methods tools to adopt in their contexts, a clear assessment of the features of the currently available tools is required. To address this goal, this paper considers a set of 13~formal methods tools that have been used for the early design of railway systems, and it presents a systematic evaluation of such tools and a preliminary usability analysis of a subset of 7~tools, involving railway practitioners. The results are discussed considering the most desired aspects by industry and earlier related studies. While the focus is on the railway signaling domain, the overall methodology can be applied to similar contexts. Our study thus contributes with a systematic evaluation of formal methods tools and it shows that despite the poor graphical interfaces, usability and maturity of the tools are not major problems, as claimed by contributions from the literature. Instead, support for process integration is the most relevant obstacle for the adoption of most of the tools. Our contribution can be useful to R&D engineers from railway signaling companies and infrastructure managers, but also to tool developers and academic researchers alike.
- 2 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 48 (11) , 4675-4691
Systematic Evaluation and Usability Analysis of Formal Methods Tools for Railway Signaling System Design
Formal methods and supporting tools have a long record of success in the development of safety-critical systems. However, no single tool has emerged as the dominant solution for system design. Each tool differs from the others in terms of the modeling language used, its verification capabilities and other complementary features, and each development context has peculiar needs that require different tools. This is particularly problematic for the railway industry, in which formal methods are highly recommended by the norms, but no actual guidance is provided for the selection of tools. To guide companies in the selection of the most appropriate formal methods tools to adopt in their contexts, a clear assessment of the features of the currently available tools is required. To address this goal, this paper considers a set of 13~formal methods tools that have been used for the early design of railway systems, and it presents a systematic evaluation of such tools and a preliminary usability analysis of a subset of 7~tools, involving railway practitioners. The results are discussed considering the most desired aspects by industry and earlier related studies. While the focus is on the railway signaling domain, the overall methodology can be applied to similar contexts. Our study thus contributes with a systematic evaluation of formal methods tools and it shows that despite the poor graphical interfaces, usability and maturity of the tools are not major problems, as claimed by contributions from the literature. Instead, support for process integration is the most relevant obstacle for the adoption of most of the tools. Our contribution can be useful to R&D engineers from railway signaling companies and infrastructure managers, but also to tool developers and academic researchers alike.
- Open Access
- 23 October 2021
- Published by Springer Nature in Empirical Software Engineering
- Vol. 27 (1) , 1-43
Efficient static analysis and verification of featured transition systems
A Featured Transition System (FTS) models the behaviour of all products of a Software Product Line (SPL) in a single compact structure, by associating action-labelled transitions with features that condition their presence in product behaviour. It may however be the case that the resulting featured transitions of an FTS cannot be executed in any product (so called dead transitions) or, on the contrary, can be executed in all products (so called false optional transitions). Moreover, an FTS may contain states from which a transition can be executed only in some products (so called hidden deadlock states). It is useful to detect such ambiguities and signal them to the modeller, because dead transitions indicate an anomaly in the FTS that must be corrected, false optional transitions indicate a redundancy that may be removed, and hidden deadlocks should be made explicit in the FTS to improve the understanding of the model and to enable efficient verification—if the deadlocks in the products should not be remedied in the first place. We provide an algorithm to analyse an FTS for ambiguities and a means to transform an ambiguous FTS into an unambiguous one. The scope is twofold: an ambiguous model is typically undesired as it gives an unclear idea of the SPL and, moreover, an unambiguous FTS can efficiently be model checked. We empirically show the suitability of the algorithm by applying it to a number of benchmark SPL examples from the literature, and we show how this facilitates a kind of family-based model checking of a wide range of properties on FTSs.
- 23 October 2021
- Published by Springer Nature in Empirical Software Engineering
- Vol. 27 (1) , 1-43
Open AccessEfficient static analysis and verification of featured transition systems
A Featured Transition System (FTS) models the behaviour of all products of a Software Product Line (SPL) in a single compact structure, by associating action-labelled transitions with features that condition their presence in product behaviour. It may however be the case that the resulting featured transitions of an FTS cannot be executed in any product (so called dead transitions) or, on the contrary, can be executed in all products (so called false optional transitions). Moreover, an FTS may contain states from which a transition can be executed only in some products (so called hidden deadlock states). It is useful to detect such ambiguities and signal them to the modeller, because dead transitions indicate an anomaly in the FTS that must be corrected, false optional transitions indicate a redundancy that may be removed, and hidden deadlocks should be made explicit in the FTS to improve the understanding of the model and to enable efficient verification—if the deadlocks in the products should not be remedied in the first place. We provide an algorithm to analyse an FTS for ambiguities and a means to transform an ambiguous FTS into an unambiguous one. The scope is twofold: an ambiguous model is typically undesired as it gives an unclear idea of the SPL and, moreover, an unambiguous FTS can efficiently be model checked. We empirically show the suitability of the algorithm by applying it to a number of benchmark SPL examples from the literature, and we show how this facilitates a kind of family-based model checking of a wide range of properties on FTSs.
- 18 February 2021
- Published by Springer Nature in Formal Methods in System Design
- Vol. 58 (1-2) , 83-125
Compositional verification of concurrent systems by combining bisimulations
- 18 February 2021
- Published by Springer Nature in Formal Methods in System Design
- Vol. 58 (1-2) , 83-125
Compositional verification of concurrent systems by combining bisimulations