Petri-net-based algorithms for parallel-controller synthesis

Bilinski, K.; Adamski, Marian; Saul, Jonathan; Dagless, EL

doi:10.1049/ip-cdt:19941508

Cited by 38 publications

(32 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Meanwhile, loaded containers are transported (signal y 12 ) to a proper location indicated by sensor x 13 . When the ingredients are ready it is signalized by preparation of the drink is finished x 10 filling off the first tank is finished x 11 filling off the second tank is finished x 12 the carriage is in its initial location x 13 the carriage is in its target location OUTPUTS Signal Description y 1 preparation of the first ingredient y 2 preparation of the second ingredient y 3 loading containers y 4 mixing ingredients y 5 valve for emptying the first container y 6 valve for emptying the second container y 7 valve for filling the first tank y 8 valve for filling the second tank y 9 carriage movement to the initial location (right) y 10 valve for filling the first container y 11 valve for filling the second container y 12 carriage movement to the target location (left)…”

Section: Example Of Control Systemmentioning

confidence: 99%

“…Each color recognizes one state machine module. The rules for Petri net coloring can be found in [2], [3], [5], [15].…”

Section: Modular Structured Petri Netmentioning

confidence: 99%

“…Such kind of net is called colored interpreted Petri net [1], [5], [15]. These colors help to intuitively and formally validate the consistency of sequential processes in the considered Petri net.…”

Section: Modular Structured Petri Netmentioning

confidence: 99%

“…COLORED MACRONET During reduction a Petri net can be converted into a more compact hierarchical description. Two reduction procedures are the most useful: Fusion of Series Places (FSP) and Fusion of Parallel Places (FPP) [5], [9], [14]. Starting from FSP both techniques are used recursively until the macronet becomes irreducible.…”

Section: Modular Structured Petri Netmentioning

confidence: 99%

“…T HE behavior and internal structure of logic controller can be initially modeled in the form Control Interpreted Petri net, very often related with Sequential Function Charts [1]- [5] or UML state machine diagrams [6], [7]. As the next design step, the topological structure of the Petri net, which can contain structurally ordered macroplaces, places and transitions, can be formally presented in the textual, rule based language, suitable for simulation, validation, verification and a rapid prototyping of reconfigurable logic controllers.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Structured Mapping of Petri Net States and Events for FPGA Implementations

Tkacz¹,

Adamski²

2013

International Journal of Electronics and Telecommunications

View full text Add to dashboard Cite

Abstract-The paper presents a new method of structured encoding of global internal states and events in Reconfigurable Logic Controllers, which are directly mapped into Field Programmable Gate Arrays (FPGA). Modular, concurrently decomposed, colored state machine is chosen as a intermediate model, before the mapping of Petri net into an array structure of dedicated but very flexible and reliable digital system. The initial textual specification in formal Gentzen logic serves both as a design description for a rapid prototyping, as well as formal model, suitable for detailed computer-based reasoning about optimized and synthesized logic controller, implemented in configurable hardware. Only the selected linear subset from general, universal propositional Gentzen Logic is necessary to deduce several properties of the net, such as relations of nonconcurrency among structurally ordered macroplaces. The goal of this paper is to present the design methodology for modeling and synthesis of discrete controllers using related Petri net theory, rule-based theory (mathematical logic), and VHDL.

show abstract

Section: Example Of Control Systemmentioning

confidence: 99%

“…Each color recognizes one state machine module. The rules for Petri net coloring can be found in [2], [3], [5], [15].…”

Section: Modular Structured Petri Netmentioning

confidence: 99%

Section: Modular Structured Petri Netmentioning

confidence: 99%

Section: Modular Structured Petri Netmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Structured Mapping of Petri Net States and Events for FPGA Implementations

Tkacz¹,

Adamski²

2013

International Journal of Electronics and Telecommunications

View full text Add to dashboard Cite

show abstract

Formal Logic Design of Reprogrammable Controllers

Adamski

Design of Embedded Control Systems

View full text Add to dashboard Cite

The goal of the paper is to present a formal, rigorous approach to the design of logic controllers, which are implemented as independent control units or as central control parts inside modern reconfigurable microsystems. A discrete model of a dedicated digital system is derived from the control interpreted Petri net behavioral specification and considered as a modular concurrent state machine. After hierarchical and distributed local state encoding, an equivalent symbolic description of a sequential system is reflected in field programmable logic by means of commercial CAD tools. The desired behavior of the designed reprogrammable logic controller can be validated by simulation in a VHDL environment.

show abstract