Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Reconstruct the Logical Network from the Transition Matrix (1710.09681v1)

Published 25 Oct 2017 in cs.SY and math.OC

Abstract: Reconstructing the logical network from the transition matrix is benefit for learning the logical meaning of the algebraic result from the algebraic representation of a BN. And so far there has no method to convert the matrix expression back to the logic expression for a BN with an arbitrary topology structure. Based on the canonical form and Karnaugh map, we propose a method for reconstructing the logical network from the transition matrix of a Boolean network in this paper.

Summary

We haven't generated a summary for this paper yet.