Refinement in Formal Proof of Equivalence in Morphisms over Strongly Connected Algebraic Automata

Journals Menu

Follow SCIRP

ISSN Print: 1945-3116
ISSN Online: 1945-3124
www.scirp.org/journal/jsea
E-mail: jsea@scirp.org

"Refinement in Formal Proof of Equivalence in Morphisms over Strongly Connected Algebraic Automata"
written by Nazir Ahmad Zafar, Ajmal Hussain, Amir Ali,
published by Journal of Software Engineering and Applications, Vol.2 No.2, 2009

has been cited by the following article(s):

[1]	Model Analysis of Equivalence Classes in UML Events Relations
	Journal of Software Engineering and Applications, 2013

[2]	Verifying Monoid and Group Morphisms over Strongly Connected Algebraic Automata
	Journal of Software Engineering and Applications, 2010

[1]	An UML+Z Framework For Validating And Verifying the Static Aspect of Safety Critical System Procedia Computer Science, 2016 DOI:10.1016/j.procs.2016.05.243

[2]	Model Analysis of Equivalence Classes in UML Events Relations Journal of Software Engineering and Applications, 2013 DOI:10.4236/jsea.2013.612078

[3]	Verifying Monoid and Group Morphisms over Strongly Connected Algebraic Automata Journal of Software Engineering and Applications, 2010 DOI:10.4236/jsea.2010.38093

Follow SCIRP