{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:50:31Z","timestamp":1730281831900,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1109\/memcod.2003.1210106","type":"proceedings-article","created":{"date-parts":[[2004,1,23]],"date-time":"2004-01-23T23:33:03Z","timestamp":1074900783000},"page":"217-226","source":"Crossref","is-referenced-by-count":1,"title":["A generalized approach to supervisor synthesis"],"prefix":"10.1109","author":[{"given":"R.","family":"Ziller","sequence":"first","affiliation":[]},{"given":"K.","family":"Schneider","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-16761-7_96"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/0325013"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/5.21072"},{"journal-title":"Verification of Reactive Systems – Algorithms and Formal Methods EATCS Texts","year":"2003","author":"schneider","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1955.5.285"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012991217536"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012991217524"},{"key":"ref17","volume":"8","author":"wilke","year":"2001","journal-title":"Alternating Tree Automata Parity Games and Modal JL-Calculus Bull Soc Math Belg"},{"key":"ref18","article-title":"Notes on control of discrete-event systems","author":"wonham","year":"2002","journal-title":"Technical Report"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/0325036"},{"journal-title":"Model checking","year":"1999","author":"clarke","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4070-7"},{"key":"ref6","first-page":"267","article-title":"Efficient model checking in fragments of the propositional mu-calculus","author":"emerson","year":"1986","journal-title":"IEEE Symposium on Logic in Computer Science (LICS)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55179-4_6"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-2217-1"},{"key":"ref7","first-page":"385","article-title":"On model-checking for fragments of ?-calculus","author":"emerson","year":"1993","journal-title":"LNCS 697 Computer Aided Verification"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1990.113767"},{"year":"2002","author":"arnold","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90065-5"},{"key":"ref20","first-page":"132","article-title":"A ?-Calculus Approach to Supervisor Synthesis","author":"ziller","year":"2003","journal-title":"GI\/ITG\/GMM-Workshop Metho-den und Beschreibungssprachen zur Modellierung und Ver-ifikation von Schaltungen und Systemen"}],"event":{"name":"2003 1st IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2003)","start":{"date-parts":[[2003,6,24]]},"location":"Mont Saint Michel, France","end":{"date-parts":[[2003,6,26]]}},"container-title":["First ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2003. MEMOCODE '03. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8593\/27232\/01210106.pdf?arnumber=1210106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T13:59:21Z","timestamp":1489413561000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1210106\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/memcod.2003.1210106","relation":{},"subject":[],"published":{"date-parts":[[2003]]}}}