On the computational complexity of the verification of modular discrete-event systems

Kurt Rohloff, Stéphane Lafortune. On the computational complexity of the verification of modular discrete-event systems. In 41st IEEE Conference on Decision and Control, CDC 2002, Las Vegas, NV, USA, December 10-13, 2002. pages 16-21, IEEE, 2002. [doi]

@inproceedings{RohloffL02,
  title = {On the computational complexity of the verification of modular discrete-event systems},
  author = {Kurt Rohloff and Stéphane Lafortune},
  year = {2002},
  doi = {10.1109/CDC.2002.1184460},
  url = {https://doi.org/10.1109/CDC.2002.1184460},
  researchr = {https://researchr.org/publication/RohloffL02},
  cites = {0},
  citedby = {0},
  pages = {16-21},
  booktitle = {41st IEEE Conference on Decision and Control, CDC 2002, Las Vegas, NV, USA, December 10-13, 2002},
  publisher = {IEEE},
  isbn = {0-7803-7516-5},
}