| 1. |
|
|
| 2. |
|
|
| 3. |
- Falkman, Petter, 1972, et al.
(författare)
-
Automatic Generation of Object Models for Process Planning and Control Purposes using an International standard for Information Exchange
- 2003
-
Ingår i: Journal of Systemics, Cybernetics and Informatics. - 1690-4524. ; 1:5
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper a formal mapping between static information models and dynamic models is presented. The static information models are given according to an international standard for product, process and resource information exchange, (ISO 10303-214). The dynamic models are described as Discrete Event Systems. The product, process and resource information is automatically converted into product routes and used for simulation, controller synthesis and verification. A high level language, combining Petri nets and process algebra, is presented and used for speci- fication of desired routes. A main implication of the presented method is that it enables the reuse of process information when creating dynamic models for process control. This method also enables simulation and verification to be conducted early in the development chain.
|
|
| 4. |
- Falkman, Petter, 1972, et al.
(författare)
-
Automatic generation of object models for process planning and control purposes using an international standard for information exchangeAutomatic Generation of Object Models
- 2003
-
Ingår i: Proceedings of the 7th World Multiconference on Systemics, cybernetics and Informatics. ; XIII, s. 382-387
-
Konferensbidrag (refereegranskat)abstract
- A formal mapping between static information models and dynamic models is presented. The static information models are given according to an international standard for product, process, and resource information exchange, (ISO 10303-214). The dynamic models are described as Discrete Event Systems. The product, process and resource information is automatically converted into product routes and used for simulation, controller synthesis and verification. A high level language, which combines Petri nets and process algebra, is presented and used for specification of desired routes. A main implication of the presented methodology is to enable the reuse of process information when creating dynamic models for process control. This methododology also enables simulation and verification to be conducted early in the development chain.
|
|
| 5. |
- Falkman, Petter, 1972, et al.
(författare)
-
Combined Process Algebra and Petri Nets for Specification of Resource Booking Problems
- 2001
-
Ingår i: American Control Conference. - 0743-1619. - 0780364953 ; 6, s. 4949-4955
-
Konferensbidrag (refereegranskat)abstract
- A modeling framework for general routing and resource booking problems is presented. The task is to specify desired routes for individual objects (products, data packets, vehicles), which are to be served by a number of shared resources (machines, computers, communication links). A high level language is presented in order to simplify the specification of desired routes. This modeling language combines Petri nets and process algebra. Process operators are introduced for specification of sequences, alternative choices, arbitrary ordered sequences and process synchronization. Multiple as well as alternative resources are easily specified utilizing sets of resources. These sets and operators imply a very compact and efficient representation of complex routing specifications. In fact, the representation is suitable for verification and synthesis based on symbolic tools such as BDDs.
|
|
| 6. |
- Falkman, Petter, 1972, et al.
(författare)
-
Modeling and Controller Synthesis for Resource Booking Problems using BDDs
- 2002
-
Ingår i: Proceedings of the 15th IFAC World Congress, Barcelona, Spain, 8 July through 12 July 2001. ; 2, s. 1011-1016
-
Konferensbidrag (refereegranskat)abstract
- A modeling framework for general routing and resource booking problems is presented. The task is to specify desired routes for individual objects (products, data packets, vehicles), which are to be served by a number of shared resources (machines, computers, communication links). Based on simple booking models for the resources and routing specifications for the objects, a controller that synchronizes the objects utilization of the available resources is automatically generated. A high level language is presented in order to simplify the specification of desired routes. This modeling language combines Petri nets and process algebra. Process operators are introduced for specification of alternative and synchronization, which are applied in order to model join and split operations. Multiple as well as alternative resources are easily specified utilizing sets of resources. These sets and operators imply a very compact and efficient representation of complex routing specifications. In fact, the representatio n is suitable for verification and synthesis based on symbolic tools such as BDDs.
|
|
| 7. |
- Falkman, Petter, 1972, et al.
(författare)
-
Modeling and Specification of Discrete Event Systems using Combined Process Algebra and Petri Nets
- 2001
-
Ingår i: Proceedings 2001 IEEE/ASME Advanced Intelligent Mecatronics, COMO, ITALY, JUL 08-12, 2001. - 2159-6255. - 0780367367 ; 2, s. 1011-1016
-
Konferensbidrag (refereegranskat)abstract
- A modeling framework for general routing and resource booking problems is presented. The task is to specify desired routes for individual objects (products, data packets, vehicles), which are to be served by a number of shared resources (machines, computers, communication links). Based on simple booking models for the resources and routing specifications for the objects, a controller that synchronizes the objects utilization of the available resources is automatically generated.A high level language is presented in order to simplify the specification of desired routes. This modeling language combines Petri nets and process algebra. Process operators are introduced for specification of alternative and synchronization, which are applied in order to model join and split operations. Multiple as well as alternative resources are easily specified utilizing sets of resources. These sets and operators imply a very compact and efficient representation of complex routing specifications. In fact, the representation is suitable for verification and synthesis based on symbolic tools such as BDDs.
|
|
