• Corpus ID: 8360642

Towards a Property Preserving Transformation from IEC 61131-3 to BIP

  title={Towards a Property Preserving Transformation from IEC 61131-3 to BIP},
  author={Jan Olaf Blech and Anton Hattendorf and Jia Huang},
We report on a transformation from Sequential Function Charts of the IEC 61131-3 standard to BIP. Our presentation features a description of formal syntax and semantics representation of the involved languages and transformation rules. Furthermore, we present a formalism for describing invariants of IEC 61131-3 systems and establish a notion of invariant preservation between the two languages. For a subset of our transformation rules we sketch a proof showing invariant preservation during the… 
An Invariant Preserving Transformation for PLC Models
  • J. Blech, A. Hattendorf, Jia Huang
  • Computer Science
    2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops
  • 2011
This work reports on a transformation from Sequential Function Charts and Function Block Diagrams of the IEC 61131 -- 3 standard to BIP, and establishes a notion of invariant preservation between the two languages.
A Formal Semantics of PLC Programs in Coq
  • Sidi Ould Biha
  • Computer Science
    2011 IEEE 35th Annual Computer Software and Applications Conference
  • 2011
This work proposes a formal semantics of the Instruction List (IL) language, one of the five programing languages defined in the IEC 61131-3 standard for PLC programing, and formalized this semantics in the proof assistant Coq and used it to prove some safety properties on an example of PL program.


Property preserving abstractions for the verification of concurrent systems
Results are given on the preservation of properties expressed in sublanguages of the branching time μ-calculus when two systemsS andS' are related via (α, γ)-simulations, using simulations parameterized by Galois connections.
An Abstract Model for Sequential Function Charts
This paper addresses points providing a clear and formal semantic framework for SFCs that can be used, for instance, as a sound basis for building validation tools.
Overview of Formal Concepts for Model Transformations Based on Typed Attributed Graph Transformation
Verification of Sequential Function Charts Using SMV
Sequential function charts (SFCs) are defined as a modeling language in the IEC 1131-3 standard [1] and can be used to structure and drive programmable logic controllers (PLCs). It includes
A Unifying Semantics for Sequential Function Charts
A parameterized formal semantics for SFCs is introduced including many high-level programming features such as parallelism, hierarchy, actions and activity manipulation and how to extend the semantics to include time, clocks, and timed actions is shown.
Compositional verification for component-based systems and application
A compositional method for the verification of component-based systems described in a subset of the BIP language encompassing multi-party interaction without data transfer based on the use of two kinds of invariants.
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
This paper reports on the development and formal certification of a compiler from Cminor (a C-like imperative language) to PowerPC assembly code, using the Coq proof assistant both for programming the compiler and for proving its correctness.
Certifying deadlock-freedom for BIP models
This paper addresses the problem of formally proving deadlock-freedom of an embedded system in a way that is comprehensible for third party users and other tools and proposes the automatic generation of certificates for each BIP model declared safe by D-Finder.
Modeling synchronous systems in BIP
A translation of Lustre into well-triggered synchronous systems is proposed and exhibits not only data-flow connections between nodes but also their synchronization by using clocks.
Generating Invariant-Based Certificates for Embedded Systems
This work is able to create certificates that come with an algorithmic description of the proof of the desired property as justification and is applied to the certification of the verdicts of a deadlock-detection tool for an asynchronous component-based language.