Modeling and proving Grafcets with transition systems

MaRDI QIDQ5754516zbMATH OpenFDO

Authors D. L'Her, Philippe le Parc, L. Marcé

Publication date 22 August 2007

zbMATH Keywords

graphical programming languageSIGNAL language

Mathematics Subject Classification ID

Theory of programming languages (68N15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A contribution to the validation of grafcet controlled systems
• Grafcet: behavioural issues and control synthesis
• scientific article; zbMATH DE number 53942
• scientific article; zbMATH DE number 791343
• Proving sequential function chart programs using timed automata

Cited in

(4)

• scientific article; zbMATH DE number 1737292 (Why is no real title available?)
• scientific article; zbMATH DE number 1836375 (Why is no real title available?)
• The Grafpol programming language for programmable logic controllers
• Combining termination proofs in model transformation systems

This page was built for publication: Modeling and proving Grafcets with transition systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5754516)