The Denotational Semantics Definition of PLC Programs Based on Extended λ-Calculus
PLC is widely used in the field of automatic control. The correctness verification methods of PLC programs include software model checking and theorem proving, etc. To use formal methods verifying the correctness of PLC programs, denotational semantics needs to define and then PLC programs can be mo...
        Saved in:
      
    
          | Published in | Advanced Research on Computer Education, Simulation and Modeling pp. 40 - 46 | 
|---|---|
| Main Authors | , , | 
| Format | Book Chapter | 
| Language | English | 
| Published | 
        Berlin, Heidelberg
          Springer Berlin Heidelberg
    
        2011
     | 
| Series | Communications in Computer and Information Science | 
| Subjects | |
| Online Access | Get full text | 
| ISBN | 9783642218019 3642218016  | 
| ISSN | 1865-0929 1865-0937  | 
| DOI | 10.1007/978-3-642-21802-6_7 | 
Cover
| Summary: | PLC is widely used in the field of automatic control. The correctness verification methods of PLC programs include software model checking and theorem proving, etc. To use formal methods verifying the correctness of PLC programs, denotational semantics needs to define and then PLC programs can be modeled, model checking and verified. Based on the extended λ-calculus definition, the paper has researched and defined the architecture and denotational semantics of PLC programs. The work is the basis of model checking and theorem proving for correctness verification on PLC programs. | 
|---|---|
| ISBN: | 9783642218019 3642218016  | 
| ISSN: | 1865-0929 1865-0937  | 
| DOI: | 10.1007/978-3-642-21802-6_7 |