A symbolic algorithm for the synthesis of bounded petri nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5062 LNCS, Issue , 2008, Pages 92-111

  Carmona, J ^a   Cortadella, J ^a   Kishinevsky, M ^b   Kondratyev, A ^c   Lavagno, L ^d   Yakovlev, A ^e  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b INTEL CORPORATION   (United States)

^c Cadence Berkeley Lab   (United States)

^d POLITECNICO DI TORINO   (Italy)

^e NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

MARINE BIOLOGY; MODEL CHECKING; PETRI NETS;

EXTENDED PETRI NETS; INTERNATIONAL CONFERENCES; MULTI-SETS; SYMBOLIC ALGORITHMS; SYMBOLIC REPRESENTATIONS; TRANSITION SYSTEMS;

GRAPH THEORY;

EID: 48249095873     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68746-7_10     Document Type: Conference Paper

References (17)

1. Badouel, E., Bernardinello, L., Darondeau, P.: Polynomial algorithms for the synthesis of bounded nets. In: Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.) TAPSOFT 1995. LNCS, vol. 915, pp. 364-383. Springer, Heidelberg (1995)
2. Badouel, E., Darondeau, P.: Theory of regions. In: Reisig, W., Rozenberg, G. (eds.) Lectures on Petri Nets I: Basic Models. LNCS, vol. 1491, pp. 529-586. Springer, Heidelberg (1998)
3. Bergenthum, R., Desel, J., Lorenz, R., Mauser, S.: Process mining based on regions of languages. In: Alonso, G., Dadam, P., Rosemann, M. (eds.) BPM 2007. LNCS, vol. 4714, pp. 375-383. Springer, Heidelberg (2007)
4. Bryant, R.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computer-Aided Design 35(8), 677-691 (1986)
5. Caillaud, B.: Synet: A synthesizer of distributable bounded Petri-nets from finite automata (2002), http://www.irisa.fr/s4/tools/synet/
6. Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (2000)
7. Cortadella, J., Kishinevsky, M., Lavagno, L., Yakovlev, A.: Deriving Petri nets from finite transition systems. IEEE Transactions on Computers 47(8), 859-882 (1998)
8. Darondeau, P.: Synthesis and control of asynchronous and distributed systems. In: Basten, T., Juhás, G., Shukla, S.K. (eds.) ACSD. IEEE Computer Society, Los Alamitos (2007)
9. Desel, J., Reisig, W.: The synthesis problem of Petri nets. Acta Informatica 33(4), 297-315 (1996)
10. Ehrenfeucht, A., Rozenberg, G.: Partial (Set) 2-Structures. Part I, II. Acta Informatica 27, 315-368 (1990)
11. Hoogers, P.W., Kleijn, H.C.M., Thiagarajan, P.S.: A trace semantics for petri nets. Inf. Comput. 117(1), 98-114 (1995)
12. Hoogers, P.W., Kleijn, H.C.M., Thiagarajan, P.S.: An event structure semantics for general petri nets. Theor. Comput. Sci. 153(1&2), 129-170 (1996)
13. Mazurkiewicz, A.W.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 255, pp. 279-324. Springer, Heidelberg (1987)
14. Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
15. Mukund, M.: Petri nets and step transition systems. Int. Journal of Foundations of Computer Science 3(4), 443-478 (1992)
16. Sokolov, D., Bystrov, A., Yakovlev, A.: Direct mapping of low-latency asynchronous controllers from STGs. IEEE Transactions on Computer-Aided Design 26(6), 993-1009 (2007)
17. Verbeek, H.M.W., Pretorius, A.J., van der Aalst, W.M.P., van Wijk, J.J.: On Petri-net synthesis and attribute-based visualization. In: Proc. Workshop on Petri Nets and Software Engineering (PNSE 2007), pp. 127-141 (June 2007)