Theoretical Computer Science
The algebra of timed processes, ATP: theory and application
Information and Computation
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
A compositional approach to performance modelling
A compositional approach to performance modelling
Theoretical Computer Science
Theoretical Computer Science - Trees in algebra and programming
The theory of interactive generalized semi-Markov processes
Theoretical Computer Science
A Testing Theory for Generally Distributed Stochastic Processes
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Timed Petri nets and preliminary performance evaluation
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
Weak Mutation Testing and Completeness of Test Sets
IEEE Transactions on Software Engineering
Testing Programs with the Aid of a Compiler
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
Formal modelling languages are powerful tools to systematically represent and analyze the properties of systems. A myriad of new modelling languages, as well as extensions of existing ones, are proposed every year. We may consider that a modelling language is useful if it allows to represent the critical aspects of systems in an expressive way. In particular, we require that the modelling language allows to accurately discriminate between correct and incorrect behaviors concerning critical aspects of the model. In this paper we present a method to assess the suitability of a modelling language to define systems belonging to a specific domain. Basically, given a system, we consider alternative correct/incorrect systems and we study whether the representations provided by the studied modelling language keep the distinction between correct and incorrect as each alternative system does.