{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T17:16:07Z","timestamp":1730222167537,"version":"3.28.0"},"reference-count":25,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1109\/fit.2014.28","type":"proceedings-article","created":{"date-parts":[[2015,6,10]],"date-time":"2015-06-10T19:24:22Z","timestamp":1433964262000},"page":"103-108","source":"Crossref","is-referenced-by-count":0,"title":["Applicability of Integrating Automata and Z: A Case Study"],"prefix":"10.1109","author":[{"given":"Nazir Ahmad","family":"Zafar","sequence":"first","affiliation":[]},{"given":"Fahad","family":"Alhumaidan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"695","article-title":"Formal construction of deterministic finite automata recognizing intersection of regular language","author":"zafar","year":"2008","journal-title":"Proceedings of International Conference on Software Engineering Research and Practice (SERP08)"},{"key":"ref11","first-page":"591","article-title":"Construction of intersection of nondeterministic finite automata using Z notation","volume":"30","author":"zafar","year":"2008","journal-title":"Proceedings of World Academy of Science Engineering and Technology"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICCSIT.2008.202"},{"journal-title":"TR-97-5493-03","article-title":"The Z\/EVES reference manual","year":"1997","author":"meisels","key":"ref13"},{"article-title":"Integrated Formal Methods (IFM99)","year":"1999","author":"araki","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICECCS.2005.56"},{"article-title":"Constructively Formalizing Automata Theory, Foundations of Computing Series","year":"2000","author":"constable","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0851-1_12"},{"journal-title":"Fundamental Approaches to Software Engineering","article-title":"Specifying safety-critical embedded systems with statecharts and Z: A case study","year":"2004","author":"b\u00fcssow","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0950-5849(00)00134-8"},{"journal-title":"Proceedings of Workshop on Real-time Tools","article-title":"TEMPO: A model-checker for event-recording automata","year":"2001","author":"sorea","key":"ref4"},{"key":"ref3","first-page":"629","article-title":"Automata: from logic to algorithms","author":"vardi","year":"2008","journal-title":"Logic Automation"},{"key":"ref6","first-page":"96","article-title":"Construction of intersection of nondeterministic finite automata using z notation","volume":"3","author":"zafar","year":"2008","journal-title":"International Journal of Computers and Electrical Engineering"},{"article-title":"The Z notation, A Reference Manual","year":"1989","author":"spivey","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICECT.2009.140"},{"journal-title":"Proceedings of International Conference on Software Engineering Research and Practice (SERP)","article-title":"Modeling navigation system of autonomous mobile robots using graph theory, automata and Z notation","year":"2011","author":"zafar","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0026419"},{"key":"ref9","first-page":"59","article-title":"Constructive formal conversion of Moore machine to deterministic finite automata","author":"riazs","year":"2008","journal-title":"Proceedings of 10th International Conference on Mathematical Methods Computational Techniques and Intelligent Systems"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/11812128_8"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/APSEC.2002.1183053"},{"journal-title":"AFOSR Summer Research Technical Report for Rome Research Site Formal Methods Framework-Monthly Status Report F30602-99-C-0166 WetStone Technologies","article-title":"The state-of-the-art in formal methods","year":"1998","author":"barjaktarovic","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CMPSAC.1997.624973"},{"journal-title":"Comput Lang","article-title":"Introduction to Automata Theory","year":"2001","author":"hopcroft","key":"ref24"},{"journal-title":"NASA LaRC Formal Methods Program","article-title":"What is Formal Methods?","year":"2001","author":"butler","key":"ref23"},{"journal-title":"Course Technology","article-title":"Introduction to the Theory of Computation","year":"2005","author":"sipser","key":"ref25"}],"event":{"name":"2014 12th International Conference on Frontiers of Information Technology (FIT)","start":{"date-parts":[[2014,12,17]]},"location":"Islamabad, Pakistan","end":{"date-parts":[[2014,12,19]]}},"container-title":["2014 12th International Conference on Frontiers of Information Technology"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7117864\/7118353\/07118382.pdf?arnumber=7118382","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T18:40:04Z","timestamp":1490380804000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7118382\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/fit.2014.28","relation":{},"subject":[],"published":{"date-parts":[[2014,12]]}}}