From bisimulation to simulation: Coarsest partition problems
From MaRDI portal
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
- scientific article; zbMATH DE number 2080064
- Deriving Bisimulations by Simplifying Partitions
- Lowerbounds for Bisimulation by Partition Refinement
- scientific article; zbMATH DE number 6970796
- scientific article; zbMATH DE number 1670835
- On the parallel complexity of bisimulation on finite systems
- scientific article; zbMATH DE number 4166873
- Bisimulation and co-induction: some problems
- On the computational complexity of bisimulation, redux
- Bisimulation by Partitioning Is Ω((m+n)log n).
Cited in
(31)- An efficient simulation algorithm based on abstract interpretation
- Fuzzy approximations of fuzzy relational structures
- An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation
- Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences
- Minimal consistent DFA from sample strings
- A parallel relation-based algorithm for symbolic bisimulation minimization
- Employing behavioral preorders to define controllability for nondeterministic discrete-event systems
- A space-efficient simulation algorithm on probabilistic automata
- An algorithm for probabilistic alternating simulation
- scientific article; zbMATH DE number 5898612 (Why is no real title available?)
- Correcting a Space-Efficient Simulation Algorithm
- AUTOMATIC SERVICE COMPOSITION VIA SIMULATION
- A Space-Efficient Probabilistic Simulation Algorithm
- Five Determinisation Algorithms
- Bisimulations for fuzzy automata
- scientific article; zbMATH DE number 2080064 (Why is no real title available?)
- scientific article; zbMATH DE number 1796125 (Why is no real title available?)
- Computing bisimulation-based comparisons
- An Incremental Bisimulation Algorithm
- Characterization and computation of approximate bisimulations for fuzzy automata
- Simulation relations and applications in formal methods
- On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations
- Computing \(k\)-bisimulations for large graphs: a comparison and efficiency analysis
- Categories of fuzzy-type automata with Kleisli morphisms
- Computation of the greatest simulations and bisimulations between fuzzy automata
- The reachable simulation problem
- Model completeness for rational trees
- Reduction of fuzzy automata by means of fuzzy quasi-orders
- Nondeterministic automata: equivalence, bisimulations, and uniform relations
- Generalizing the Paige-Tarjan algorithm by abstract interpretation
- Fuzzy relation equations and reduction of fuzzy automata
This page was built for publication: From bisimulation to simulation: Coarsest partition problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1431342)
