Sensor Graphs for Discrete Event Modeling Applied to Formal Verification of PLCs

Alenljung, Tord; Lennartson, Bengt; Hosseini, Mojtaba

doi:10.1109/tcst.2011.2168607

Cited by 19 publications

(5 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Alenlejung et al introduced the discrete event modeling language Sensor Graphs, which is intended for modeling physical systems from the perspective of a PLC programmer and for usage within formal verification, process observation, and fault detection [11]. Nellen et al presented two CEGAR-based methodologies for the reachability analysis of SFC-controlled chemical plants [12].…”

Section: Röshe Et Al and Ovatman Et Al Presented Review Papers On Mod...mentioning

confidence: 99%

A New Method for Verification and Evaluation of PLC Software

Kaymakçı

2022

JISE

View full text Add to dashboard Cite

Varying market demands and changes in production standards require production systems to be effortlessly modifiable and quickly operational. On the other hand, designing, developing, and testing the control system of a new production system prove costly and time-consuming. Therefore most engineers write codes intuitively and apply basic and insufficient tests. This study aims to develop a reusable and quickly implementable method that will accurately translate RTC program and the behavior of RTC in a modular Petri net model. Through this translated model the system and safety requirements written in the Computation Tree Logic can be verified. An advantage of this method is that it does not require a plant model which makes it reusable for new plants and provides a quick verification method for codes written intuitively. A case study is given to demonstrate the correctness of our method.

show abstract

Section: Röshe Et Al and Ovatman Et Al Presented Review Papers On Mod...mentioning

confidence: 99%

A New Method for Verification and Evaluation of PLC Software

Kaymakçı

2022

JISE

View full text Add to dashboard Cite

show abstract

“…Theorem 1. If the SAT problem Φ H SAT has a solution, 3 the solution to the PM-SAT problem Φ H SAT , Φ S SAT satisfies transition (q, i, q ).…”

Section: Pmsat-encoding Of the Transformation Problemmentioning

confidence: 99%

“…Mapping a DSL to a Moore Machine-based semantics has been done before [3,5,24]. However, to the best of our knowledge, we are the first to define a predicative semantics of a DSL based on PMSAT.…”

Section: Related Workmentioning

confidence: 99%

Giving a Model-Based Testing Language a Formal Semantics via Partial MAX-SAT

Aichernig

Burghard

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Domain-specific Languages (DSLs) are widely used in modelbased testing to make the benefits of modeling available to test engineers while avoiding the problem of excessive learning effort. Complex DSLs benefit from a formal definition of their semantics for model processing as well as consistency checking. A formal semantics can be established by mapping the model domain to a well-known formalism. In this paper, we present an industrial use case which includes a mapping from domainspecific models to Moore Machines, based on a Partial MAX-SAT problem, encoding a predicative semantics for the model-to-model mapping. We show how Partial MAX-SAT solves the frame problem for a nontrivial DSL in which the non-effect on variables cannot be determined statically. We evaluated the performance of our model-transformation algorithm based on models from our industrial use case.

show abstract

“…Their structural complexity prohibits the application of dexterous control mechanisms. As always, a supervisor may involve too many conditional constraints that result in numerous sensors, actuators, and connection nodes [1]- [6], [27], [31]. As a common sense, intricate control system may lead to higher cost but lower reliability [3].…”

Section: Introductionmentioning

confidence: 99%

“…There are six GMECs, i.e., l T 1· M ≤ b 1 ⇔ M( p 11 ) + M( p 21 ) ≤ 3, l T 2 · M ≤ b 2 ⇔ M( p 12 ) + M( p 21 ) ≤ 2, l T 3 · M ≤ b 3 ⇔ M( p 11 ) + M( p 21 ) + M( p 22 ) ≤ 3, l T 4 · M ≤ b 4 ⇔ M( p 11 ) + M( p 22 ) ≤ 2, l T 5 · M ≤ b 5 ⇔ M( p 11 ) + M( p 12 )+ M( p 21 ) ≤ 3, and l T 6 · M ≤ b 6 ⇔ M( p 11 )+ M( p 12 ) + M( p 21 ) + M( p 22 ) ≤ 3.After we decrease b 6 from b 6 = 3 to b 6 = 2, we have l 1 ≤ l 6 , l 2 ≤ l 6 , l 3 ≤ l 6 , l 4 ≤ l 6 , and l 5 ≤ l 6 as well as b1 ≥ b 6 , b 2 ≥ b 6 , b 3 ≥ b 6 , b 4 ≥ b6 , and b 5 ≥ b 6 . According to Theorem 2, we apparently can identify l T 6 · M ≤ b 6 ⇔ M( p 11 ) + M( p 12 ) + M( p 21 ) + M( p 22 ) ≤ 2 as the unique independent inequality.…”

mentioning

confidence: 98%

Supervisor Simplification in FMSs: Comparative Studies and New Results Using Petri Nets

Liu

Yuan

2016

IEEE Trans. Contr. Syst. Technol.

View full text Add to dashboard Cite

Modern complex systems require intensive application of sophisticated supervisors. Structural simplification techniques are one of the fundamental researches in the context of flexible manufacturing systems (FMSs). They can reduce implementation cost, mitigate fabrication complexity, and improve reliability. Several typical methods have been developed along this direction. In order to thoroughly explore their effectiveness and performance, we not only conduct a comparison investigation but also develop some new theoretical results. Several analytical results and performance measures are proposed for their qualitative and quantitative comparison. Our approach can assist researchers and practitioners to better comprehend the inherent mechanisms and relative merits of these simplification methodologies as well as their applicability in FMSs. This paper is motivated by FMSs' control; however, it is also applicable to other systems with discrete event controllers.

show abstract

Sensor Graphs for Discrete Event Modeling Applied to Formal Verification of PLCs

Cited by 19 publications

References 38 publications

A New Method for Verification and Evaluation of PLC Software

A New Method for Verification and Evaluation of PLC Software

Giving a Model-Based Testing Language a Formal Semantics via Partial MAX-SAT

Supervisor Simplification in FMSs: Comparative Studies and New Results Using Petri Nets

Contact Info

Product

Resources

About