Synthesis of Petri Nets from Finite Partial Languages

Proceedings - 7th International Conference on Application of Concurrency to System Design, ACSD 2007

Volumn , Issue , 2007, Pages 157-166

  Lorenz, Robert ^a   Bergenthum, Robin ^a   Desel, Jörg ^a   Mauser, Sebastian ^a  

^a CATHOLIC UNIVERSITY OF EICHSTÄTT INGOLSTADT   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; GRAPH THEORY; LINGUISTICS; MARINE BIOLOGY; MODEL STRUCTURES; PETRI NETS; SEQUENTIAL SWITCHING; SET THEORY; SYSTEMS ANALYSIS;

(E ,2E) THEORY; (EXTENDED) PETRI NETS; FINITE SETS; INTERNATIONAL CONFERENCES; LANGUAGES (TRADITIONAL); PARTIAL ORDERS; SYNTHESIS (OF CHIRAL IONIC LIQUIDS); SYSTEM DESIGNS; SYSTEM MODELLING;

QUERY LANGUAGES;

EID: 51149116824     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSD.2007.34     Document Type: Conference Paper

References (17)

1. E. Badouel and P. Darondeau. On the synthesis of general petri nets. Technical Report 3025, Inria, 1996.
2. J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, and A. Yakovlev. Petrify: A tool for manipulating concurrent specifications and synthesis of asynchronous con-trollers. IEICE Trans. of Informations and Systems, E80-D(3):315-325, 1997.
3. J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, and A. Yakovlev. Hardware and petri nets: Application to asynchronous circuit design. In M. Nielsen; D. Simpson, editor, CAT, volume 1825 of Lecture Notes in Computer Science, pages 1-15. Springer, 2000.
4. P. Darondeau. Deriving unbounded petri nets from formal languages. In D. Sangiorgi; R. de Simone, editor, CONCUR, volume 1466 of Lecture Notes in Computer Science, pages 533-548. Springer, 1998.
5. J. Desel, G. Juhás, and R. Lorenz. Viptool-homepage., 2003. http://www.informatik.ku-eichstaett.de/projekte/vip/.
6. A. Ehrenfeucht and G. Rozenberg. Partial (set) 2-structures. part i: Basic notions and the representation problem. Acta Inf., 27(4):315-342, 1989.
7. A. Ehrenfeucht and G. Rozenberg. Partial (set) 2-structures. part ii: State spaces of concurrent systems. Acta Inf., 27(4):343-368, 1989.
8. J. Grabowski. On partial languages. Fundamenta Informaticae, 4(2):428-498, 1981.
9. M. B. Josephs and D. P. Furey. A programming approach to the design of asynchronous logic blocks. In J. Cortadella, A. Yakovlev, and G. Rozenberg, editors, Concurrency and Hardware Design, volume 2549 of Lecture Notes in Computer Science, pages 34-60. Springer, 2002.
10. G. Juhás, R. Lorenz, and J. Desel. Can i execute my scenario in your net?. In G. Ciardo and P. Darondeau, editors, ICATPN, volume 3536 of Lecture Notes in Computer Science, pages 289-308. Springer, 2005.
11. A. Kiehn. On the interrelation between synchronized and non-synchronized behaviour of petri nets. Elektronische Informationsverarbeitung und Kybernetik, 24(1/2):3-18, 1988.
12. R. Lorenz and G. Juhás. Towards synthesis of petri nets from scenarios. In S. Donatelli and P. S. Thiagarajan, editors, ICATPN, volume 4024 of Lecture Notes in Computer Science, pages 302-321. Springer, 2006.
13. H.Minkowski. Geometrie der Zahlen. Teubner, 1896.
14. T. Motzkin. Beiträge zur Theorie der linearen Ungleichungen. PhD thesis, Jerusalem, 1936.
15. V. Pratt. Modelling concurrency with partial orders. Int. Journal of Parallel Programming, 15:33-71, 1986.
16. W. M. P. van der Aalst, T. Weijters, and L. Maruster. Workflow mining: Discovering process models from event logs. IEEE Trans. Knowl. Data Eng., 16(9):1128-1142, 2004.
17. W. Vogler. Modular Construction and Partial Order Semantics of Petri Nets., volume 625 of Lecture Notes in Computer Science. Springer, 1992.