(2023). Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets. Logical Methods in Computer Science.
Successfully copied to clipboard
Copying to clipboard failed
Chicago Style (17th ed.) Citation
"Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets."
Logical Methods in Computer Science 2023.
Successfully copied to clipboard
Copying to clipboard failed
MLA (9th ed.) Citation
"Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets."
Logical Methods in Computer Science, 2023.
Successfully copied to clipboard
Copying to clipboard failed
Warning: These citations may not always be 100% accurate.