scientific article; zbMATH DE number 1927588

MaRDI QIDQ4484513zbMATH OpenFDO

Authors Antonin Kučera, Richard M. Mayr

Publication date 12 June 2003

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Simulation preorder over simple process algebras
• scientific article; zbMATH DE number 6970796
• Deciding bisimilarity and similarity for probabilistic processes.
• Decision procedures and graph reductions for bisimulation equivalences part 1
• scientific article; zbMATH DE number 1705168

Cited in

(12)

• An efficient simulation algorithm based on abstract interpretation
• A comparison of succinctly represented finite-state systems
• scientific article; zbMATH DE number 1114007 (Why is no real title available?)
• scientific article; zbMATH DE number 1512618 (Why is no real title available?)
• Exploring the tractability border in epistemic tasks
• On the parallel complexity of bisimulation on finite systems
• Simulation relations and applications in formal methods
• The reachable simulation problem
• Coupled Similarity and Contrasimilarity, and How to Compute Them
• Generalizing the Paige-Tarjan algorithm by abstract interpretation
• On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
• EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system

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 Q4484513)