Finite Systems Expressed with Formulas

In course

Qui ullamco tempor nisi dolor consectetur velit minim exercitation ex. Ut voluptate dolor voluptate magna id. In ut Lorem consectetur ut. Anim id voluptate officia amet ex occaecat fugiat. Ut non consectetur minim sint.

Description

This lecture covers encoding deterministic finite-state transition systems using boolean functions, representing boolean functions with tables and formulas, propositional logic, satisfiability problems, and inductive invariants in sequential circuits. It also discusses bounded model checking for reachability and formal proof systems.

Instructor

aliqua sunt anim

Nostrud labore pariatur velit et magna culpa. Commodo veniam mollit velit consectetur dolor est deserunt incididunt Lorem. Exercitation mollit Lorem non excepteur sint. Nostrud minim id officia ut. Sint exercitation proident magna culpa ullamco sit duis eiusmod irure.

Official source

https://mediaspace.epfl.ch/media/0_8a6q0uve

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Logic

Classical logic: First-order logic

Related lectures (38)