PLC-automata: a new class of implementable real-time automata
Theoretical Computer Science - Special issue on real-time systems and concurrent and distributed software
Bounded Model Checking Using Satisfiability Solving
Formal Methods in System Design
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Detecting Races in Relay Ladder Logic Programs
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Proceedings of the 17th International Conference on Application and Theory of Petri Nets
TCS:: a DSL for the specification of textual concrete syntaxes in model engineering
Proceedings of the 5th international conference on Generative programming and component engineering
Time Petri Nets Analysis with TINA
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Locksmithing and Electronic Security Wiring Diagrams
Locksmithing and Electronic Security Wiring Diagrams
Model checking bounded prioritized time Petri nets
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
MoDELS'05 Proceedings of the 2005 international conference on Satellite Events at the MoDELS
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Hi-index | 0.00 |
Ladder Diagram (LD) is the most used programming language for Programmable Logical Controllers (PLCs). A PLC is a special purpose industrial computer used to automate industrial processes. Bugs in LD programs are very costly and sometimes are even a threat to human safety. We propose a model driven approach for formal verification of LD programs through model-checking. We provide a metamodel for a subset of the LD language. We define a time Petri net (TPN) semantics for LD programs through an ATL model transformation. Finally, we automatically generate behavioral properties over the LD models as LTL formulae which are then checked over the generated TPN using the model-checkers available in the Tina toolkit. We focus on race condition detection.