RERS 2019: Combining Synthesis with Real-World Models

Jasper, Marc; Mues, Malte; Murtovi, Alnis; Schlüter, Maximilian; Howar, Falk; Steffen, Bernhard; Schordan, Markus; Hendriks, Dennis; Schiffelers, R.R.H.; Kuppens, Harco; Vaandrager, Frits

doi:10.1007/978-3-030-17502-3_7

Cited by 19 publications

(9 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An area where learning algorithms for symbolic traces potentially can have major impact is the inference of behavior interfaces of legacy control software. As pointed out in [28], such interfaces allow components to be developed, analyzed, deployed and maintained in isolation. This is achieved using enabling techniques, among which are model checking (to prove interface compliance), observers (to check interface compliance), armoring (to separate error handling from component logic) and test generation (to increase test coverage).…”

Section: Discussionmentioning

confidence: 99%

A Myhill-Nerode Theorem for Register Automata and Symbolic Trace Languages

Vaandrager

Midya

2020

Theoretical Aspects of Computing – ICTAC 2020

View full text Add to dashboard Cite

This publication is distributed under the terms of Article 25fa of the Dutch Copyright Act (Auteurswet) with explicit consent by the author. Dutch law entitles the maker of a short scientific work funded either wholly or partially by Dutch public funds to make that work publicly available for no consideration following a reasonable period of time after the work was first published, provided that clear reference is made to the source of the first publication of the work. This publication is distributed under The Association of Universities in the Netherlands (VSNU) 'Article 25fa implementation' pilot project. In this pilot research outputs of researchers employed by Dutch Universities that comply with the legal requirements of Article 25fa of the Dutch Copyright Act are distributed online and free of cost or other barriers in institutional repositories. Research outputs are distributed six months after their first online publication in the original published version and with proper attribution to the source of the original publication.You are permitted to download and use the publication for personal purposes. Please note that you are not allowed to share this article on other platforms, but can link to it. All rights remain with the author(s) and/or copyrights owner(s) of this work. Any use of the publication or parts of it other than authorised under this licence or copyright law is prohibited. Neither Radboud University nor the authors of this publication are liable for any damage resulting from your (re)use of this publication.If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the ma terial

show abstract

Section: Discussionmentioning

confidence: 99%

A Myhill-Nerode Theorem for Register Automata and Symbolic Trace Languages

Vaandrager

Midya

2020

Theoretical Aspects of Computing – ICTAC 2020

View full text Add to dashboard Cite

show abstract

“…To address this issue, several efforts have been performed in the community of formal methods for system and software engineering. Well known initiatives targeting a more comprehensive and comparable view of formal tools are: tool competitions (see, e.g., [69], [70]), mostly oriented to assess performance over shared benchmarks [10]; the ETI initiative [71], aimed at creating an online service to experiment with different formal tools; the comprehensive study by Garavel and Graf [9], a report of over 300 pages characterising the landscape of available methods. Differently from these initiatives, our work focuses on the railway domain, is systematic and is oriented to practitioners.…”

Section: A Formal Methods and Toolsmentioning

confidence: 99%

Systematic Evaluation and Usability Analysis of Formal Tools for Railway System Design

Ferrari,

Mazzanti,

Basile

et al. 2021

Preprint

View full text Add to dashboard Cite

Formal methods and supporting tools have a long record of successes in the development of safety-critical systems. However, it cannot be said that a single tool has emerged as the dominant solution for system design. Each tool differs from the others in terms of modelling language used, 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 tools to adopt for their contexts, a clear assessment of the features of the available tools is required. To address this goal, this paper considers a set of 14 formal tools for system design, and presents a systematic evaluation of the tools and a usability analysis with practitioners. Results are discussed considering the most desired aspects by industry and previous related work. The focus is on the railway domain, but the overall methodology can be applied to similar contexts. Our study contributes with a systematic evaluation of formal tools and shows that despite the poor graphical interfaces, usability and maturity of the tools are not major problems, as claimed by other works. Instead, process integration support is the most relevant pain point for the majority of the platforms.

show abstract

“…The RERS Challenge [9,[19][20][21] is an annual event involving a number of different categories of large model checking problems. The "parallel LTL category," offered from 2016 on, is directly relevant to this paper.…”

Section: Related Workmentioning

confidence: 99%

Action-Based Model Checking: Logic, Automata, and Reduction

Siegel

Yan

2020

Computer Aided Verification

View full text Add to dashboard Cite

Stutter invariant properties play a special role in state-based model checking: they are the properties that can be checked using partial order reduction (POR), an indispensable optimization. There are algorithms to decide whether an LTL formula or Büchi automaton (BA) specifies a stutter-invariant property, and to convert such a BA to a form that is appropriate for on-the-fly POR-based model checking. The interruptible properties play the same role in action-based model checking that stutter-invariant properties play in the state-based case. These are the properties that are invariant under the insertion or deletion of "invisible" actions. We present algorithms to decide whether an LTL formula or BA specifies an interruptible property, and show how a BA can be transformed to an interrupt normal form that can be used in an on-the-fly POR algorithm. We have implemented these algorithms in a new model checker named McRERS, and demonstrate their effectiveness using the RERS 2019 benchmark suite.

show abstract

RERS 2019: Combining Synthesis with Real-World Models

Cited by 19 publications

References 26 publications

A Myhill-Nerode Theorem for Register Automata and Symbolic Trace Languages

A Myhill-Nerode Theorem for Register Automata and Symbolic Trace Languages

Systematic Evaluation and Usability Analysis of Formal Tools for Railway System Design

Action-Based Model Checking: Logic, Automata, and Reduction

Contact Info

Product

Resources

About