From napkin sketches to reliable software

Engelen, Ljp Luc

doi:10.6100/ir740040

Cited by 14 publications

(1 citation statement)

References 79 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…it must be action (or event) based. For example, in our research we focus on the visual modelling language SLCO [5], which allows the specification and development of concurrent and distributed systems by defining sets of (interacting) finite state machines.…”

Section: Introductionmentioning

confidence: 99%

Confluence Detection for Transformations of Labelled Transition Systems

Wijs

2015

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

The development of complex component software systems can be made more manageable by first creating an abstract model and then incrementally adding details. Model transformation is an approach to add such details in a controlled way. In order for model transformation systems to be useful, it is crucial that they are confluent, i.e. that when applied on a given model, they will always produce a unique output model, independent of the order in which rules of the system are applied on the input. In this work, we consider Labelled Transition Systems (LTSs) to reason about the semantics of models, and LTS transformation systems to reason about model transformations. In related work, the problem of confluence detection has been investigated for general graph structures. We observe, however, that confluence can be detected more efficiently in special cases where the graphs have particular structural properties. In this paper, we present a number of observations to detect confluence of LTS transformation systems, and propose both a new confluence detection algorithm and a conflict resolution algorithm based on them.Comment: In Proceedings GaM 2015, arXiv:1504.0244

show abstract

Section: Introductionmentioning

confidence: 99%

Confluence Detection for Transformations of Labelled Transition Systems

Wijs

2015

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

Efficient modelling, generation and analysis of Markov Automata

Timmer¹

View full text Add to dashboard Cite

Quantitative model checking is concerned with the verification of both quantitative and qualitative properties over models incorporating quantitative information. Increases in expressivity of the models involved allow more types of systems to be analysed, but also raise the difficulty of their efficient analysis.Three years ago, the Markov automaton (MA) was introduced as a generalisation of probabilistic automata and interactive Markov chains, supporting nondeterminism, discrete probabilistic choice as well as stochastic timing (Markovian rates). Later, the tool IMCA was developed to compute time-bounded reachability probabilities, expected times and long-run averages for sets of goal states within an MA. However, an efficient formalism for modelling and generating MAs was still lacking. Additionally, the omnipresent state space explosion also threatened the analysability of these models. This thesis solves the first problem and contributes significantly to the solution of the second.

show abstract

Abstract graph transformation

Zambon

View full text Add to dashboard Cite

From napkin sketches to reliable software

Cited by 14 publications

References 79 publications

Confluence Detection for Transformations of Labelled Transition Systems

Confluence Detection for Transformations of Labelled Transition Systems

Efficient modelling, generation and analysis of Markov Automata

Abstract graph transformation

Contact Info

Product

Resources

About