Synthesis of a nondeterministic automaton from its logical specification. II

DOI10.1007/BF02366616zbMath0868.68079OpenAlexW4241120145MaRDI QIDQ1816006

Anatoli N. Chebotarev

Publication date: 21 November 1996

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

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

zbMATH Keywords

synthesis algorithm\(k\)-transition domain

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). I

Cites Work

• Consistency test for simple specifications of automaton systems
• Synthesis of a nondeterministic automaton from its logical specification. I

This page was built for publication: Synthesis of a nondeterministic automaton from its logical specification. II