From bisimulation to simulation: Coarsest partition problems

DOI10.1023/A:1027328830731MaRDI QIDQ1431342zbMATH OpenOpenAlexFDO

Authors Raffaella Gentilini, Carla Piazza, Alberto Policriti

Publication date 27 May 2004

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1027328830731

zbMATH Keywords

simulationbisimulationpartition refinement problems

Mathematics Subject Classification ID

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

(28)

• Computation of the greatest simulations and bisimulations between fuzzy automata
• Bisimulations for fuzzy automata
• A Space-Efficient Probabilistic Simulation Algorithm
• Five Determinisation Algorithms
• Fuzzy relation equations and reduction of fuzzy automata
• Correcting a Space-Efficient Simulation Algorithm
• scientific article; zbMATH DE number 1796125 (Why is no real title available?)
• Reduction of fuzzy automata by means of fuzzy quasi-orders
• scientific article; zbMATH DE number 2080064 (Why is no real title available?)
• Employing behavioral preorders to define controllability for nondeterministic discrete-event systems
• Computing \(k\)-bisimulations for large graphs: a comparison and efficiency analysis
• Computing bisimulation-based comparisons
• Fuzzy approximations of fuzzy relational structures
• Characterization and computation of approximate bisimulations for fuzzy automata
• On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations
• Nondeterministic automata: equivalence, bisimulations, and uniform relations
• Generalizing the Paige-Tarjan algorithm by abstract interpretation
• Simulation relations and applications in formal methods
• Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences
• An algorithm for probabilistic alternating simulation
• An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation
• An efficient simulation algorithm based on abstract interpretation
• A space-efficient simulation algorithm on probabilistic automata
• An Incremental Bisimulation Algorithm
• AUTOMATIC SERVICE COMPOSITION VIA SIMULATION
• scientific article; zbMATH DE number 5898612 (Why is no real title available?)
• A parallel relation-based algorithm for symbolic bisimulation minimization
• Minimal consistent DFA from sample strings

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)