scientific article; zbMATH DE number 2102770

zbMath1046.68627MaRDI QIDQ4818858

Sandeep Kumar Shukla, Richard E. Stearns, Harry B. III Hunt, Daniel J. Rosenkrantz

Publication date: 24 September 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (8)

Complexity of reachability problems for finite discrete dynamical systems ⋮ Complexity of equivalence problems for concurrent systems of finite agents ⋮ Reachability problems for sequential dynamical systems with threshold functions. ⋮ Hardness of preorder checking for basic formalisms ⋮ Predecessor existence problems for finite discrete dynamical systems ⋮ EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system ⋮ Hardness of equivalence checking for composed finite-state systems ⋮ On the complexity of verifying concurrent transition systems

This page was built for publication: