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

(14)

• Optimizing an LTS-simulation algorithm
• Incremental algorithms for solving regular expression intersection non-emptiness
• 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
• scientific article; zbMATH DE number 1705168 (Why is no real title available?)
• scientific article; zbMATH DE number 6811486 (Why is no real title available?)
• Reasoning About Regular Properties: A Comparative Study
• An aperiodic set of 11 Wang tiles
• Simulations in rank-based Büchi automata complementation
• The reachable simulation problem

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)