Foundation for a series of efficient simulation algorithms

MaRDI QIDQ5144615zbMATH OpenFDO

Authors Gérard Cécé

Publication date 19 January 2021

Full work available at URL https://arxiv.org/abs/1709.01826, http://dl.acm.org/citation.cfm?id=3330004

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• An efficient simulation algorithm based on abstract interpretation
• Saving space in a time efficient simulation algorithm
• Correcting a Space-Efficient Simulation Algorithm

Cited in

(12)

• An algorithm for computing simulation on finite labeled transition systems
• The complexity of simulation and matrix multiplication
• Reasoning About Regular Properties: A Comparative Study
• Correcting a Space-Efficient Simulation Algorithm
• Rank and simulation: the well-founded case
• scientific article; zbMATH DE number 6811486 (Why is no real title available?)
• Saving space in a time efficient simulation algorithm
• Simulations in rank-based Büchi automata complementation
• An aperiodic set of 11 Wang tiles
• scientific article; zbMATH DE number 1705168 (Why is no real title available?)
• Optimizing an LTS-simulation algorithm
• An efficient simulation algorithm based on abstract interpretation

This page was built for publication: Foundation for a series of efficient simulation algorithms

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