Cite
A Polynomial-Time Algorithm to Obtain State Machine Cover of Live and Safe Petri Nets.
MLA
Karatkevich, Andrei G., and Remigiusz Wisniewski. “A Polynomial-Time Algorithm to Obtain State Machine Cover of Live and Safe Petri Nets.” IEEE Transactions on Systems, Man & Cybernetics. Systems, vol. 50, no. 10, Oct. 2020, pp. 3592–97. EBSCOhost, https://doi.org/10.1109/TSMC.2019.2894778.
APA
Karatkevich, A. G., & Wisniewski, R. (2020). A Polynomial-Time Algorithm to Obtain State Machine Cover of Live and Safe Petri Nets. IEEE Transactions on Systems, Man & Cybernetics. Systems, 50(10), 3592–3597. https://doi.org/10.1109/TSMC.2019.2894778
Chicago
Karatkevich, Andrei G., and Remigiusz Wisniewski. 2020. “A Polynomial-Time Algorithm to Obtain State Machine Cover of Live and Safe Petri Nets.” IEEE Transactions on Systems, Man & Cybernetics. Systems 50 (10): 3592–97. doi:10.1109/TSMC.2019.2894778.