scientific article; zbMATH DE number 6970796
From MaRDI portal
Publication:4553282
Recommendations
- On the parallel complexity of bisimulation on finite systems
- On the computational complexity of bisimulation, redux
- Finite bisimulations for dynamical systems with overlapping trajectories
- scientific article; zbMATH DE number 1670835
- On Simulations and Bisimulations of General Flow Systems
- Hybrid Systems: Computation and Control
- An efficient fully symbolic bisimulation algorithm for non-deterministic systems
- scientific article; zbMATH DE number 1759489
- Bisimulation invariance and finite models
- scientific article; zbMATH DE number 1301620
Cites work
- scientific article; zbMATH DE number 1696534 (Why is no real title available?)
- scientific article; zbMATH DE number 1303030 (Why is no real title available?)
- scientific article; zbMATH DE number 1088188 (Why is no real title available?)
- scientific article; zbMATH DE number 2155191 (Why is no real title available?)
- scientific article; zbMATH DE number 1864591 (Why is no real title available?)
- scientific article; zbMATH DE number 784042 (Why is no real title available?)
- Algorithmic meta theorems for circuit classes of constant and logarithmic depth
- Behavioural equivalences on finite-state systems are PTIME-hard
- CCS expressions, finite state processes, and three problems of equivalence
- Canonizing graphs of bounded tree width in logspace
- Circuits, matrices, and nonassociative computation
- Completeness results for graph isomorphism.
- Counting quantifiers, successor relations, and logarithmic space
- Deciding bisimilarity is P-complete
- Equivalence and preorder checking for finite-state systems
- Fundamentals of parameterized complexity
- L-recursion and a new logic for logarithmic space
- Nondeterministic Space is Closed under Complementation
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
- On the parallel complexity of bisimulation on finite systems
- On the relative complexity of some languages in \(NC^ 1\)
- On uniform circuit complexity
- On uniformity within \(NC^ 1\)
- Reactive Systems
- Recent developments on graphs of bounded clique-width
- Testing Graph Isomorphism in Parallel by Playing a Game
- The complexity of acyclic conjunctive queries
- The method of forced enumeration for nondeterministic automata
- Three Partition Refinement Algorithms
- Tree-size bounded alternation
- Two Applications of Inductive Counting for Complementation Problems
- Uniform constant-depth threshold circuits for division and iterated multiplication.
Cited in
(10)- From bisimulation to simulation: Coarsest partition problems
- Constrained simulations, nested simulation semantics and counting bisimulations
- Bisimulation and coverings for graphs and hypergraphs
- Bisimulation Finiteness of Pushdown Systems Is Elementary
- On the parallel complexity of bisimulation on finite systems
- Computing bisimulation-based comparisons
- A comparison of succinctly represented finite-state systems
- scientific article; zbMATH DE number 1927588 (Why is no real title available?)
- On the computational complexity of bisimulation, redux
- The Bisimulation Problem for Equational Graphs of Finite Out-Degree
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4553282)
