2012
DOI: 10.1007/978-3-642-34032-1_24
|View full text |Cite
|
Sign up to set email alerts
|

Optimising Ordering Strategies for Symbolic Model Checking of Railway Interlockings

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
21
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 27 publications
(24 citation statements)
references
References 18 publications
0
21
0
Order By: Relevance
“…The paper uses a variant of linear temporal logic (LTL) for safety property specification and employs so-call k-induction. The work of [55] investigates how to exploit domain-specific knowledge about interlocking verification to obtain good variable orderings when encoding the systems to be verified in a BDD-based symbolic model checker. An influential technology is the tool-based support for verified code generation for railway interlockings from Prover AB Sweden [5].…”
Section: Related Workmentioning
confidence: 99%
“…The paper uses a variant of linear temporal logic (LTL) for safety property specification and employs so-call k-induction. The work of [55] investigates how to exploit domain-specific knowledge about interlocking verification to obtain good variable orderings when encoding the systems to be verified in a BDD-based symbolic model checker. An influential technology is the tool-based support for verified code generation for railway interlockings from Prover AB Sweden [5].…”
Section: Related Workmentioning
confidence: 99%
“…To illustrate and evaluate our approach we have devised a case study based on existing networks from [18,19] inspired by the typical examples from real world used in other studies about formal verification of railway interlocking systems [5,7,9,22]. The used network, although invented, represents a realistic case.…”
Section: Mini-tiny-fork: a Small Case Studymentioning
confidence: 99%
“…Locality of a safety property can be exploited for verification purposes, by limiting the state space on which to verify it. This principle has been exploited in [22] to define domain-oriented optimizations of the variable ordering in a BDD-based verification. Locality can be used also for slicing, as suggested in [3] and [10,8].…”
Section: Introductionmentioning
confidence: 99%
“…Several techniques have been proposed in order to push the applicability bounds toward industrial size. Winter et al suggest using ordering strategies optimized for interlocking models [23]. A number of high-level abstractions for reducing the complexity of interlocking models are presented in [15].…”
Section: Related Workmentioning
confidence: 99%
“…Thus, automated verification of interlocking systems is an active research topic, investigated by several research groups, see e.g. [10,8,23,15,9,14]. As part of the RobustRailS research project 3 , our work aims at establishing a holistic method supporting the verification of such systems.…”
Section: Introductionmentioning
confidence: 99%