Author
Georgiana Caltais
Bio: Georgiana Caltais is an academic researcher from University of Konstanz. The author has contributed to research in topics: Causality (physics) & Model checking. The author has an hindex of 5, co-authored 10 publications receiving 35 citations.
Papers
More filters
03 Jan 2019
TL;DR: The current work is a natural extension of the previously proposed approach handling causality in the context of LTL-definable safety properties, with the major difference that now, counterexamples of general LTL properties are not merely finite traces, but infinite lasso-shaped traces.
Abstract: In this paper we provide a notion of causality for the violation of general Linear Temporal Logic (LTL) properties. The current work is a natural extension of the previously proposed approach handling causality in the context of LTL-definable safety properties. The major difference is that now, counterexamples of general LTL properties are not merely finite traces, but infinite lasso-shaped traces. We analyze such infinite counterexamples and identify the relevant ordered occurrences of causal events, obtained by unfolding the looping part of the lasso shaped counterexample sufficiently many times. The focus is on LTL properties from practical considerations: the current results are to be implemented in QuantUM, a tool for causality checking, that exploits explicit state LTL model checking.
10 citations
06 Oct 2016
TL;DR: This paper proposes a transformation of Sys ML models into the NuSMV input language and relies on a notion of intermediate model structuring the relevant SysML components in an object-oriented fashion.
Abstract: This paper proposes a transformation of SysML models into the NuSMV input language. The transformation is performed automatically using SysMV-Ja and relies on a notion of intermediate model structuring the relevant SysML components in an object-oriented fashion.
10 citations
26 Aug 2016
TL;DR: The work of Georgiana Caltais was partially supported by an Independent Research Start-up Grant founded by Zukunftskolleg at Konstanz University.
Abstract: The work of Georgiana Caltais was partially supported by an
Independent Research Start-up Grant founded by Zukunftskolleg at Konstanz University. The work
of Mohammad Reza Mousavi has been partially supported by the Swedish Research Council (Vetenskapsradet)
award number: 621-2014-5057 (Effective Model-Based Testing of Concurrent Systems) and ˚
the Swedish Knowledge Foundation (Stiftelsen for Kunskaps- och Kompetensutveckling) in the context ¨
of the AUTO-CAAS HoG project (number: 20140312).
8 citations
TL;DR: The work of Georgiana Caltais was partially supported by an Independent Research Start-up Grant founded by Zukunftskolleg at Konstanz University.
Abstract: In this paper we introduce a notion of counterfactual causality in the Halpern and Pearl sense that is compositional with respect to the interleaving of transition systems. The formal framework for reasoning on what caused the violation of a safety property is established in the context of labeled transition systems and Hennessy Milner logic. The compositionality results are devised for non-communicating systems.
7 citations
01 Jan 2020
TL;DR: This paper reduces showing the correctness of the transformation to showing a notion of what they refer to as observational equivalence of the SysML and the generated Promela models, respectively, which paves the way to a proof technique that could be further exploited in order to argue the Correctness of model transformations from Sys ML to various model checkers.
Abstract: In this paper we discuss the correctness of an ATL-based model transformation from the systems engineering modelling language SysML into Promela, the input language of the SPIN model checker. More precisely, we reduce showing the correctness of the transformation to showing a notion of what we refer to as observational equivalence of the SysML and the generated Promela models, respectively. This paves the way to a proof technique that could be further exploited in order to argue the correctness of model transformations from SysML to various model checkers, based on the observable actions generated by the systems under analysis.
5 citations
Cited by
More filters
01 Jan 2009
TL;DR: This paper presents a meta-modelling framework for modeling and testing the robustness of the modeled systems and some of the techniques used in this framework have been developed and tested in the field.
Abstract: ing WS1S Systems to Verify Parameterized Networks . . . . . . . . . . . . 188 Kai Baukus, Saddek Bensalem, Yassine Lakhnech and Karsten Stahl FMona: A Tool for Expressing Validation Techniques over Infinite State Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 204 J.-P. Bodeveix and M. Filali Transitive Closures of Regular Relations for Verifying Infinite-State Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 220 Bengt Jonsson and Marcus Nilsson Diagnostic and Test Generation Using Static Analysis to Improve Automatic Test Generation . . . . . . . . . . . . . 235 Marius Bozga, Jean-Claude Fernandez and Lucian Ghirvu Efficient Diagnostic Generation for Boolean Equation Systems . . . . . . . . . . . . 251 Radu Mateescu Efficient Model-Checking Compositional State Space Generation with Partial Order Reductions for Asynchronous Communicating Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 266 Jean-Pierre Krimm and Laurent Mounier Checking for CFFD-Preorder with Tester Processes . . . . . . . . . . . . . . . . . . . . . . . 283 Juhana Helovuo and Antti Valmari Fair Bisimulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 299 Thomas A. Henzinger and Sriram K. Rajamani Integrating Low Level Symmetries into Reachability Analysis . . . . . . . . . . . . . 315 Karsten Schmidt Model-Checking Tools Model Checking Support for the ASM High-Level Language . . . . . . . . . . . . . . 331 Giuseppe Del Castillo and Kirsten Winter Table of
1,687 citations
01 Jan 1997
TL;DR: This chapter contains sections titled: Organizing Committee, Motivations and Goals, Contributions, Proceedings.
Abstract: This chapter contains sections titled: Organizing Committee, Motivations and Goals, Contributions, Proceedings
196 citations
Journal Article•
TL;DR: This work surveys algorithms proposed for LTL verification and identifies two good algorithms, a new algorithm based on nested DFS, and another based on strongly connected components.
Abstract: The automata-theoretic approach to LTL verification relies on an algorithm for finding accepting cycles in a Biichi automaton. Explicit-state model checkers typically construct the automaton on the fly and explore its states using depth-first search. We survey algorithms proposed for this purpose and identify two good algorithms, a new algorithm based on nested DFS, and another based on strongly connected components. We compare these algorithms both theoretically and experimentally and determine cases where both algorithms can be useful.
123 citations
TL;DR: Graphical Symbolic Modeling Toolkit (GSMT) is presented to design and verify the behavioral models of distributed systems to improve the model checking weaknesses.
Abstract: Model checking is an influential method to verify complex interactions, concurrent and distributed systems. Model checking constructs a behavioral model of the system using formal concepts such as operations, states, events and actions. The model checkers suffer some weaknesses such as state space explosion problem that has high memory consumption and time complexity. Also, automating temporal logic is the main challenge to define critical specification rules in the model checking. To improve the model checking weaknesses, this paper presents Graphical Symbolic Modeling Toolkit (GSMT) to design and verify the behavioral models of distributed systems. A behavioral modeling framework is presented to design the system behavior in the forms of Kripke structure (KS) and Labeled Transition System (LTS). The behavioral models are created and edited using a graphical user interface platform in four layers that include a design layer, a modeling layer, a logic layer and a symbolic code layer. The GSMT generates a graphical modeling diagram visually for creating behavioral models of the system. Also, the temporal logic formulas are constructed according to some functional properties automatically. The executable code is generated according to the symbolic model verifier that user can choose the original model or reduced model with respect to a recursive reduced model. Finally, the generated code is executed using the NuSMV model checker for evaluating the constructed temporal logic formulas. The code generation time for transforming the behavioral model is compared to other model checking platforms. The proposed GSMT platform has outperformed evaluation than other platforms.
30 citations
01 Jan 1999
TL;DR: The paper reviews past work in Software Performance Engineering, summarises the Unified Modelling Language and presents encouraging results from merging these two techniques.
Abstract: The use of performance analysis and prediction techniques by software designers and software engineers is at best inconsistent and at worst simply does not happen. This is principally because these techniques are seen as separate and difficult to apply. Work on Software Performance Engineering, initiated by Smith, has sought to bridge the gap, but has had limited success. With the emergence of a widely accepted standard for software design, the Unified Modelling Language, the time seems ripe for an attempt to integrate performance directly into this process, by exploiting the notation directly. The paper reviews past work in Software Performance Engineering, summarises the Unified Modelling Language and presents encouraging results from merging these two techniques.
26 citations