Publication:3424633
From MaRDI portal
zbMath1109.68052MaRDI QIDQ3424633
Publication date: 7 March 2007
verification; computational complexity; bisimulation equivalence; trace equivalence; PTIME-hardness; finite transition systems
68Q25: Analysis of algorithms and problem complexity
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Unnamed Item, Hardness of preorder checking for basic formalisms, EXPTIME-completeness of thorough refinement on modal transition systems, Component simulation-based substitutivity managing QoS and composition issues, Hardness of equivalence checking for composed finite-state systems, Refinement checking on parametric modal transition systems