{"title":"Event grammars: a modeling representation for business procedures","authors":"R. Lee, Y.U. Ryu","doi":"10.1109/HICSS.1989.49289","DOIUrl":null,"url":null,"abstract":"An alternative representation for modeling organizational procedures is proposed, called event grammars, which is based on the definite-clause grammar formalism used for natural-language parsing. A graphical counterpart, called event nets, is also introduced. In effect, a history of events is recognized as conforming to a particular procedure, analogous to the way in which a list of words is recognized by a particular grammar. Event grammars are intermediate to state transition networks and Petri nets in that they capture contingencies between events but only a limited amount of concurrency. However, considerable compactness of representation is achieved.<<ETX>>","PeriodicalId":384442,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HICSS.1989.49289","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
An alternative representation for modeling organizational procedures is proposed, called event grammars, which is based on the definite-clause grammar formalism used for natural-language parsing. A graphical counterpart, called event nets, is also introduced. In effect, a history of events is recognized as conforming to a particular procedure, analogous to the way in which a list of words is recognized by a particular grammar. Event grammars are intermediate to state transition networks and Petri nets in that they capture contingencies between events but only a limited amount of concurrency. However, considerable compactness of representation is achieved.<>