On the formal verification of routing in material handling systems

Klotz, Thomas; Sessler, Norman; Straube, Bernd; Fordran, Eva; Turek, Karsten; Schönherr, Jens

doi:10.1109/coase.2012.6386358

Cited by 3 publications

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the current implementation, feedback loops connecting MHS subnetworks have to be resolved (feedback loops inside MHS subnetworks will stay untouched), before the actual method can be applied. This is done automatically by a preprocessing [13]: the beginning of each feedback loop in the MHS is replaced by a source creating the corresponding cargo types C out and an appropriate sink consuming incoming cargos.…”

Section: Topological Sortingmentioning

confidence: 99%

See 1 more Smart Citation

Compositional verification of material handling systems

Klotz

Sesler

Straube

et al. 2012

Proceedings of 2012 IEEE 17th International Conference on Emerging Technologies &Amp; Factory Automation (ETFA 2012)

Self Cite

View full text Add to dashboard Cite

The design of properly working material handling systems (MHS) is a difficult process as these systems consist of a vast number of single elements with dedicated controls. While currently these systems are usually validated using simulation, formal methods provide a means to analyze the complete behavior of a system. However, these methods can often only be applied to systems of a moderate size, which hampers their application to verify realworld systems. This paper presents an approach to the compositional verification of MHS, which is based on the theory of assume-guarantee reasoning. The approach has been implemented in a tool that automatically carries out the verification. The application of the approach is shown using a real-world example

show abstract

Section: Topological Sortingmentioning

confidence: 99%

“…There, the algorithm iterates over the topological levels in ascending order (lines [7][8][9][10][11][12][13][14]. For all subnetworks SN verify of the same topological level, forward assumptions are determined by calling ComputeForward(N, SN) (line 10).…”

Section: Description Of the Algorithmsmentioning

confidence: 99%

Compositional verification of material handling systems

Klotz

Sesler

Straube

et al. 2012

Proceedings of 2012 IEEE 17th International Conference on Emerging Technologies &Amp; Factory Automation (ETFA 2012)

Self Cite

View full text Add to dashboard Cite

show abstract

GOAL for Games, Omega-Automata, and Logics

Tsai

Tsay

Hwang

2013

Computer Aided Verification

View full text Add to dashboard Cite

This paper introduces the second generation of GOAL, which is a graphical interactive tool for games, ω-automata, and logics. It is a complete redesign with an extensible architecture, many enhancements to existing functions, and new features. The extensible architecture allows easy integration of third-party plugins. The enhancements provide more automata conversion, complementation, simplification, and testing algorithms, translation of full QPTL formulae, and better automata navigation with more layout algorithms and utility functions. The new features include game solving, manipulation of two-way alternating automata, translation of ACTL formulae and ω-regular expressions, test of language star-freeness, classification of ω-regular languages into the temporal hierarchy of Manna and Pnueli, and a script interpreter.

show abstract