Unambiguous Interpretation of IEC 60848 GRAFCET based on a Literature Review
IEC 60848 GRAFCET is a standardized, graphical specification language for control functions. Because of the semiformal nature of IEC 60848, the details of specifications created with GRAFCET can be interpreted in different ways, possibly leading to faulty implementations. These ambiguities have been partially addressed in existing literature, but solved in different manners. Based on a literature review, this work aims at providing an overview of existing interpretations and, based on that, proposes a comprehensive interpretation algorithm for IEC 60848, which takes all relevant ambiguities from the literature review into account.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Sistemas de control basados en el estandar grafcet para la alteracion de bombas centrifugas
From the implementation of the Grafcet programming language we obtain in this document the different ways of applying this method, the advantages it obtains with respect to efficiency, cost, quality and operational and t…
TAPHSIR: Towards AnaPHoric Ambiguity Detection and ReSolution In Requirements
We introduce TAPHSIR, a tool for anaphoric ambiguity detection and anaphora resolution in requirements. TAPHSIR facilities reviewing the use of pronouns in a requirements specification and revising those pronouns that ca…
Language ModelingLanguage ModellingModelling and Classifying the Components of a Literature Review
Previous work has demonstrated that AI methods for analysing scientific literature benefit significantly from annotating sentences in papers according to their rhetorical roles, such as research gaps, results, limitation…
Zero-Shot LearningAn Algorithmic Framework for Systematic Literature Reviews: A Case Study for Financial Narratives
This paper introduces an algorithmic framework for conducting systematic literature reviews (SLRs), designed to improve efficiency, reproducibility, and selection quality assessment in the literature review process. The …
Sentiment AnalysisLearning of Structurally Unambiguous Probabilistic Grammars
The problem of identifying a probabilistic context free grammar has two aspects: the first is determining the grammar's topology (the rules of the grammar) and the second is estimating probabilistic weights for each rule…