scientific article
From MaRDI portal
Publication:3424633
zbMath1109.68052MaRDI QIDQ3424633
Publication date: 7 March 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
verificationcomputational complexitybisimulation equivalencetrace equivalencePTIME-hardnessfinite transition systems
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Hardness of preorder checking for basic formalisms, EXPTIME-completeness of thorough refinement on modal transition systems, Unnamed Item, 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
