On the execution of discrete event systems as sequential function charts

Hellgren, Anders; Fabian, Martin; Lennartson, Bengt

doi:10.1109/cca.2001.973903

Cited by 6 publications

(4 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, this is not a safe solution. Note, though, that the immediate transit execution models, see [6], will resolve these situations, but only in the case that an ordering of the SFCs is well defined. However, such an ordering does not exist in general.…”

Section: '2 21mentioning

confidence: 95%

“…X respectively. The deferred transit execution models, see [6], still fail because the state of the transition conditions does not change during their evaluation. The immediate transit execution models, though, now work regardless of the ordering of the SFCs.…”

Section: '2 21mentioning

confidence: 98%

“…In [6] we define some possible ways to order the different tasks of the SFC execution and study the behaviour of the execution models thus obtained. For brevity we refer to [6] for a discussion of the relevant problems and a comparison with the standard.…”

Section: B Sfc Execution Modelsmentioning

confidence: 99%

“…In [4], [6] and [7], problems that arise when implementing (possibly) modular finite state automata or Petri nets using Sequential Function Charts (SFCs) [8], [9] are addressed. The main problems are identified as mutual exclusion and synchronisation.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Modular implementation of discrete event systems as sequential function charts applied to an assembly cell

Hellgren

Fabian²,

Lennartson³

Proceedings of the 2001 IEEE International Conference on Control Applications (CCA'01) (Cat. No.01CH37204)

Self Cite

View full text Add to dashboard Cite

Abstracr-Modular implementation of discrete event models in Programmable Logic Controllers (PLCs) using Sequential Function Charts (SFCs) is investigated. Synchronisation of such models, typically finite state automata of Petri nets, is not well defined in the synchronous PLC-world. We develop an algorithm that computes event monitors for synchronising concurrently executingSFCs. The methodology is applied to an assembly cell.

show abstract

Section: '2 21mentioning

confidence: 95%

Section: '2 21mentioning

confidence: 98%

Section: B Sfc Execution Modelsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Modular implementation of discrete event systems as sequential function charts applied to an assembly cell

Hellgren

Fabian²,

Lennartson³

Proceedings of the 2001 IEEE International Conference on Control Applications (CCA'01) (Cat. No.01CH37204)

Self Cite

View full text Add to dashboard Cite

show abstract

General Untimed Sequential Automata Models for the General Components of Automatic Transport Systems with Accumulation Areas

Anghel

Proştean

Ionescu

2008

2008 International Conference on Intelligent Engineering Systems

View full text Add to dashboard Cite

General untimed Petri net models for the general components of automatic transport systems with accumulation areas

Ungureanu-Anghel

Raduca

Răduca

et al. 2009

2009 5th International Symposium on Applied Computational Intelligence and Informatics

View full text Add to dashboard Cite

Discrete event systems have been researched for quite a while in the domain literature. A series of modelling and analysis techniques have been used. Petri net models give an opportunity of their studies and theories have been born to provide tools for their design. Automatic transport systems with accumulation areas are a particular type of systems where the Petri net model can be successfully used.The aim of this paper is to establish a Petri net model: first for a node with "one" input and "m" outputs and the second for a node with "n" inputs and "m" outputs, using basic elements of the automatic transport systems with accumulation areas. General models for an automatic transport system with accumulation areas are obtain by composing sub-models. In this paper, untimed Petri nets have been used for modelling, time being not a defining element for this modelling.Keywords: automatic transport systems with accumulation areas, Petri net, discrete event systems, discrete event system elements.

show abstract

On the execution of discrete event systems as sequential function charts

Cited by 6 publications

References 7 publications

Modular implementation of discrete event systems as sequential function charts applied to an assembly cell

Modular implementation of discrete event systems as sequential function charts applied to an assembly cell

General Untimed Sequential Automata Models for the General Components of Automatic Transport Systems with Accumulation Areas

General untimed Petri net models for the general components of automatic transport systems with accumulation areas

Contact Info

Product

Resources

About