From bisimulation to simulation: Coarsest partition problems
From MaRDI portal
Publication:1431342
DOI10.1023/A:1027328830731zbMath1081.68052OpenAlexW1543732613MaRDI QIDQ1431342
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
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
An Algorithm for Probabilistic Alternating Simulation, A space-efficient simulation algorithm on probabilistic automata, Fuzzy approximations of fuzzy relational structures, Minimal consistent DFA from sample strings, Characterization and computation of approximate bisimulations for fuzzy automata, On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations, Simulation relations and applications in formal methods, Correcting a Space-Efficient Simulation Algorithm, Bisimulations for fuzzy automata, Nondeterministic automata: equivalence, bisimulations, and uniform relations, AUTOMATIC SERVICE COMPOSITION VIA SIMULATION, Generalizing the Paige-Tarjan algorithm by abstract interpretation, A Space-Efficient Probabilistic Simulation Algorithm, An efficient simulation algorithm on Kripke structures, Computation of the greatest simulations and bisimulations between fuzzy automata, Fuzzy relation equations and reduction of fuzzy automata, Five Determinisation Algorithms, An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation, Reduction of fuzzy automata by means of fuzzy quasi-orders, Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences, An efficient simulation algorithm based on abstract interpretation, Employing behavioral preorders to define controllability for nondeterministic discrete-event systems
