Name
Abstract | ||
|---|---|---|
A recently proposed generic discrete event model is further developed and exemplified in this paper. Since every transition is expressed as a predicate on the current and next values of a set of variables, the model is called Predicate Transition Model (PTM). It is briefly illustrated how a number of well known discrete-event models, including automata and Petri nets extended with shared variables, can be formulated and synthesized in the PTM framework. More specifically modular Petri nets with shared variables (PNSVs) are shown to be significantly more readable compared to ordinary Petri nets. PTMs are also naturally extended to hybrid systems, and finally it is shown how easy and efficiently PNSVs can be optimized concerning performance based on Constraint Programming. To summarize, the proposed modeling framework unifies and simplifies both synthesis, optimization and implementation of discrete event systems. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.3182/20140514-3-FR-4046.00140 | IFAC Proceedings Volumes |
Keywords | Field | DocType |
discrete-event systems,automata,Petri net,supervisory control,synthesis,hybrid systems,optimization | Petri net,Computer science,Supervisory control,Constraint programming,Automaton,Algorithm,Stochastic Petri net,Theoretical computer science,Modular design,Unified Model,Hybrid system | Conference |
Volume | Issue | ISSN |
47 | 2 | 1474-6670 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bengt Lennartson | 1 | 934 | 118.87 |
| Oskar Wigström | 2 | 22 | 4.44 |
| Martin Fabian | 3 | 204 | 27.91 |
| Francesco Basile | 4 | 60 | 12.50 |