scientific article; zbMATH DE number 1927559

MaRDI QIDQ4484483zbMATHFDO

Authors Kousha Etessami

Publication date 12 June 2003

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 8122
• Deterministic automata. Simulation, universality and minimality
• A linear-time simulation of deterministic \(d\)-limited automata
• DNA Computing
• On the computational complexity of P automata
• scientific article; zbMATH DE number 4195202
• scientific article; zbMATH DE number 1839454
• Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies
• Simulation algorithms for symbolic automata

Cited in

(25)

• Multi-buffer simulations for trace language inclusion
• scientific article; zbMATH DE number 1951589 (Why is no real title available?)
• Capacitated automata and systems
• Game-theoretic simulation checking tool
• scientific article; zbMATH DE number 1954381 (Why is no real title available?)
• Büchi automata can have smaller quotients
• scientific article; zbMATH DE number 1189125 (Why is no real title available?)
• Computing the width of non-deterministic automata
• Width of non-deterministic automata
• Büchi Good-for-Games Automata Are Efficiently Recognizable
• Enhancing Simulation for Checking Language Containment
• Complementing Büchi Automata with Ranker
• Simulations in rank-based Büchi automata complementation
• Advanced Ramsey-based Büchi automata inclusion testing
• THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA
• scientific article; zbMATH DE number 1754630 (Why is no real title available?)
• A comparison of succinctly represented finite-state systems
• Multipebble simulations for alternating automata (extended abstract)
• Simulation relations and applications in formal methods
• Efficient State Space Reduction for Automata by Fair Simulation
• Multi-buffer simulations: decidability and complexity
• Matching in security-by-contract for mobile code
• scientific article; zbMATH DE number 2009954 (Why is no real title available?)
• Topological characterisation of multi-buffer simulation
• scientific article; zbMATH DE number 8122 (Why is no real title available?)

Describes a project that uses

Uses Software

• SPIN

This page was built for publication:

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