Simulation as coarsest partition problem

DOI10.1007/3-540-46002-0_29MaRDI QIDQ4472257zbMATH OpenFDO

Authors Carla Piazza, Alberto Policriti, Raffaella Gentilini

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2280/22800415.htm

Mathematics Subject Classification ID

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

Recommendations

• From bisimulation to simulation: Coarsest partition problems
• Probabilistic divide-and-conquer: a new exact simulation method, with integer partitions as an example
• Computing and Combinatorics
• Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space
• scientific article; zbMATH DE number 1538871
• Discrete and continuous models for partitioning problems
• scientific article; zbMATH DE number 5520539
• The parallel complexity of coarsest set partition problems
• Simulation complexity

Cited in

(7)

• Probabilistic weak simulation is decidable in polynomial time
• From bisimulation to simulation: Coarsest partition problems
• An efficient algorithm for computing bisimulation equivalence
• scientific article; zbMATH DE number 5520539 (Why is no real title available?)
• scientific article; zbMATH DE number 4045190 (Why is no real title available?)
• A fast bisimulation algorithm
• Model completeness for rational trees

This page was built for publication: Simulation as coarsest partition problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472257)