scientific article; zbMATH DE number 7301461

MaRDI QIDQ5146599zbMATH OpenFDO

Authors Katrin Iltgen, Walter Vogler

Publication date 26 January 2021

Full work available at URL http://eptcs.web.cse.unsw.edu.au/paper.cgi?EXPRESS2009.6

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 2219130
• scientific article; zbMATH DE number 1796125
• Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes
• An implementation of an efficient algorithm for bisimulation equivalence
• Foundations of Software Science and Computational Structures
• Bisimulation on speed: a unified approach
• An efficient algorithm for computing bisimulation equivalence
• Bisimulation on speed: Lower time bounds
• Foundations of Software Science and Computation Structures
• scientific article; zbMATH DE number 1927586

Cited in

(1)

• Bisimulation on speed: Lower time bounds

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