A Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks

Eyal Weiss, Michael Margaliot. A Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks. IEEE Trans. Automat. Contr., 64(7):2727-2736, 2019. [doi]

@article{WeissM19-1,
  title = {A Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks},
  author = {Eyal Weiss and Michael Margaliot},
  year = {2019},
  doi = {10.1109/TAC.2018.2882154},
  url = {https://doi.org/10.1109/TAC.2018.2882154},
  researchr = {https://researchr.org/publication/WeissM19-1},
  cites = {0},
  citedby = {0},
  journal = {IEEE Trans. Automat. Contr.},
  volume = {64},
  number = {7},
  pages = {2727-2736},
}