Foundation for a series of efficient simulation algorithms

zbMATH Open1457.68301arXiv1709.01826MaRDI QIDQ5144615FDOQ5144615

Authors: Gérard Cécé 

Publication date: 19 January 2021

Full work available at URL: https://arxiv.org/abs/1709.01826

Recommendations

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

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)

Cited In (12)

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

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)