On Computation Complexity of the Concurrently Enabled Transition Set Problem

DOI10.1007/978-3-540-72504-6_20zbMath1198.68179OpenAlexW1505013782MaRDI QIDQ5425435

Gang Wei, Weidong Zhao, Li Pan, Shumei Wang, Zhi-Cheng Wang

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72504-6_20

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: On Computation Complexity of the Concurrently Enabled Transition Set Problem