Timed networks are parametrised systems of timed automata. Solving reachability problems for this class of systems allows one to prove safety properties regardless of the number of processes in the network. Usually, these problems are attacked in the following way: the number n of processes in the network is fixed and a tool for timed automata (like Uppaal) is used to check the desired property for increasing values of n. In this paper, we explain how to deal with fully parametric reachability problems for timed networks by translation into the declarative input language of mcmt, a model checker for infinite state systems based on Satisfiability Modulo Theories techniques. We show the success of our approach on a number of standard algorithms, such as the Fischer protocol. Preliminary experiments show that fully parametric problems can be more easily solved by mcmt than their instances for a fixed (and large) number of processes by other systems.

Abstract. This paper presents the AValLa language, a domain-specic modelling language for scenario-based validation of ASM models, and its supporting tool, the AsmetaVvalidator. They have been developed according to the model-driven development principles as part of the asmeta(ASM mETAmodelling) toolset, a set of tools around ASMs. As a proof-of-concepts, the paper reports the results of the scenario-based validation for the well-known LIFT control case study. IntroductionThe success of developing complex systems depends on the use of a pertinent method for identifying the requirements on the target system and to make sure that the produced system will actually meet these requirements. Validation is intended as the process of investigating a model (intended as formal specication) with respect to its user perceptions, in order to ensure that the specication really reects the user needs and statements about the application, and to detect faults in the specication as early as possible with limited eort. Validation should precede the application of more expensive and accurate methods, like formal requirements analysis and verication of properties, that should be applied only when a designer has enough condence that the specication captures all informal requirements. Techniques for validation include scenarios generation, development of prototypes, animation, simulation, and also testing [28].In [21], we dened the AsmetaL language as concrete syntax to write Abstract State Machine (ASM) models and the AsmetaS simulator to execute AsmetaL programs. In order to validate AsmetaL specications, we here investigate the scenario-based approach for system validation. In this context, scenarios describe the behavior of a system from a global perspective by looking at the observable interactions between the system and its environment in specic situations.Scenarios are useful to ensure correct capture of informal requirements and to explore system functionalities and alternative design solutions. To make this approach eective by allowing the designer to interact with the specication, we dene a language, called AValLa (ASM Validation Language), which provides suitable commands to express, at ASM model level, the interaction between a system and its environment (in the sense of UML use-cases) and the interaction between a system and an external observer who likes to play with the system model and check the system state.AValLa has been developed according to the model-driven language engineering principles which require the abstract syntax of a language be dened in terms of an (object-oriented) model, called metamodel, characterizing syntax elements and their relationships. A concrete notation can be then (automatically)derived from the abstract syntax. The language semantics is given in terms of ASMs, here used as formal semantic framework to express the operational semantics of metamodel-based languages.AValLa is supported by the AsmetaV (ASM Validator) tool to execute AValLa scenarios. Both have been developed within the asmeta...

No abstract

No abstract

No abstract