Model Checking Timed Systems with Urgencies

Hsiung, Pao-Ann; Lin, Shang-Wei; Chen, Yean-Ru; Huang, Chun-Hsian; Yeh, Jia-Jen; Sun, Hongyu; Lin, Chao-Sheng; Liao, Hsiao-Win

doi:10.1007/11901914_8

Cited by 5 publications

(5 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We extrapolate that this was one of the motivations to introduce UA and benefit from both the abovementioned advantage (expressing time easily through a whole execution path) and an easy and efficient expression of urgencies. In [36], the authors corroborate as they describe why UA are needed in many real-world contexts (such as robotics).…”

Section: A On the Formalismsmentioning

confidence: 53%

See 1 more Smart Citation

Toward a Correct-and-Scalable Verification of Concurrent Robotic Systems: Insights on Formalisms and Tools

Foughali

2017

2017 17th International Conference on Application of Concurrency to System Design (ACSD)

View full text Add to dashboard Cite

Formal verification of robotic functional components is extremely important. Indeed, with the growing involvement of autonomous systems in everyday life, we may no longer rely on classical testing and simulation to establish our trust in them. However, the formalization of such systems is challenging considering the various existing formalisms and their respective advantages/drawbacks. One may express more easily in one formalism and verify more easily in another depending on the aspects/properties they are modeling/verifying. Furthermore, both the reusability of the formalization and the scalability of the obtained formal models are crucial elements in the verification process. In this paper, we present modeling concurrency aspects of robotic functional components in Time Petri Nets, Timed Automata and Timed Automata extended with urgencies. Formal models are automatically generated and verification is conducted on each of them. Both the expressiveness of the formalisms and scalability of the obtained models are evaluated and future directions are consequently outlined.

show abstract

Section: A On the Formalismsmentioning

confidence: 53%

“…The integration of urgencies in TA-based verification tools is quite recent. In [36], the authors claim that their work is the first that integrates urgencies to a model checker, namely SGM [39]. The wellknown model checking tool UPPAAL [40] allows now urgent channels.…”

Section: Discussionmentioning

confidence: 99%

Toward a Correct-and-Scalable Verification of Concurrent Robotic Systems: Insights on Formalisms and Tools

Foughali

2017

2017 17th International Conference on Application of Concurrency to System Design (ACSD)

View full text Add to dashboard Cite

show abstract

“…Further, urgent transitions are also given higher priority than lazy transitions. A novel clock zone subtraction operation is required here [12].…”

Section: Transition Prioritymentioning

confidence: 99%

“…We also had to check if there are any transitions between states with unknown risk levels. For implementing safe nondeterminism, we had to support prioritized transitions in SGM, which we accomplished using a clock zone subtraction operation [12], [21]. We also prove the semantic equivalence between Safecharts and the generated set of ETA.…”

Section: Implementation In a Model Checkermentioning

confidence: 99%

See 1 more Smart Citation

Model Checking Safety-Critical Systems Using Safecharts

Hsiung

Chen

Lin

2007

IEEE Trans. Comput.

Self Cite

View full text Add to dashboard Cite

Abstract-With rapid developments in science and technology, we now see the ubiquitous use of different types of safety-critical systems in our daily lives such as in avionics, consumer electronics, and medical systems. In such systems, unintentional design faults might result in injury or even death to human beings. To make sure that safety-critical systems are really safe, there is a need to verify them formally. However, the verification of such systems is getting more and more difficult because designs are becoming very complex. To cope with high design complexity, currently, model-driven architecture design is becoming a well-accepted trend. However, existing methods of testing and standards conformance are restricted to implementation code, so they do not fit very well with model-based approaches. To bridge this gap, we propose a model-based formal verification technique for safety-critical systems. In this work, the model-checking paradigm is applied to the Safecharts model, which was used for modeling but not yet used for verification. Our contributions listed are as follows: First, the safety constraints in Safecharts are mapped to semantic equivalents in timed automata for verification. Second, the theory for safety constraint verification is proven and implemented in a compositional model checker (that is, the State-Graph Manipulator (SGM)). Third, prioritized and urgent transitions are implemented in SGM to model the risk semantics in Safecharts. Finally, it is shown that the priority-based approach to mutual exclusion of resource usage in the original Safecharts is unsafe and corresponding solutions are proposed here. Application examples show the feasibility and benefits of the proposed model-driven verification of safety-critical systems.

show abstract