A graphic language based on timing diagrams

DOI10.1007/BF02745517zbMath1009.68516OpenAlexW1990017745MaRDI QIDQ5955785

Jean-Eric Pin, Bernard Le Goff, Christian Antoine

Publication date: 18 February 2002

Published in: Sādhanā (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02745517

zbMATH Keywords

VLSIconcatenation leveltiming diagrams

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• First-order logic and star-free sets
• Classifying regular events in symbolic logic
• The dot-depth hierarchy of star-free languages is infinite
• A functional model for describing and reasoning about time behaviour of computing systems
• Lucid—A Formal System for Writing and Proving Programs

This page was built for publication: A graphic language based on timing diagrams