Proving sequential function chart programs using timed automata

DOI10.1016/S0304-3975(00)00301-7zbMath0984.68101OpenAlexW1970311687MaRDI QIDQ5958730

D. L'Her, L. Marcé, P. L. Parc

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00301-7

zbMATH Keywords

timed automataformal methodscheckingsequential function chart (SFC)TCTL logic

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Uses Software

• Unnamed Item
• LUSTRE

Cites Work

• Symbolic model checking for real-time systems
• Formal development of reactive systems. Case study production cell
• Unnamed Item

This page was built for publication: Proving sequential function chart programs using timed automata