Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

SOME COMPLEXITY RESULTS FOR RINGS OF PETRI NETS

From MaRDI portal
Publication:4853328
Jump to:navigation, search

DOI10.1142/S0129054194000153zbMath0830.68094MaRDI QIDQ4853328

Ming-Shang Yang, Hsu-Chun Yen, Bow-Yaw Wang

Publication date: 29 October 1995

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)


zbMATH Keywords

Petri netscyclic communicating finite state machines


Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)








This page was built for publication: SOME COMPLEXITY RESULTS FOR RINGS OF PETRI NETS

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4853328&oldid=19199908"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 03:33.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki