Region based synthesis of P/T-nets and its potential applications

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

Volumn 1825, Issue , 2000, Pages 16-23

  Darondeau, Philippe ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR ALGEBRA;

AXIOMATIC CHARACTERIZATION; DECISION PROBLEMS; DISTRIBUTED CONTROL; DISTRIBUTED SOFTWARE; ELEMENTARY NET; INFORMAL PRESENTATION; INTEGER VALUES; SYNTHESIS PROBLEMS;

PETRI NETS;

EID: 84947280060     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44988-4_2     Document Type: Conference Paper

References (18)

1. Chernikova, N.V.: Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities. U.S.S.R. Computational Math. and Math. Physics 5 no.2 (1965) 228-233
2. Arnold, A., Nivat, M.: Comportements de processus. Les mathématiques de l'informatique, colloque AFCET (1982) 35-68
3. Ehrenfeucht, A., Rozenberg, G.: Partial (Set) 2-Structures; part I: Basic Notions and the Representation Problem. Acta Informatica 27 (1990) 315-342
4. Ehrenfeucht, A., Rozenberg, G.: Partial (Set) 2-Structures; part II: State Spaces of Concurrent Systems. Acta Informatica 27 (1990) 343-368
5. Mukund, M.: Petri Nets and Step Transition Systems. Int. Journal of Found. of Comp. Science 3 no.4 (1992) 443-478
6. Rudie, K., Wonham, W.M.: Think Globally, Act Locally: Decentralized Supervi- sory Control. IEEE Trans. on Automatic Control 37 no.11 (1992) 1692-1707
7. Droste, M., Shortt, R.M.: Petri Nets and Automata with Concurrency Relations - an Adjunction. Semantics of Programming Languages and Model Theory, M. Droste and Y. Gurevich eds (1993) 69-87
8. Badouel, E., Bernardinello, L., Darondeau, Ph.: Polynomial algorithms for the synthesis of bounded nets. Proc. CAAP, LNCS 915 (1995) 364-378
9. Jancar, P., Moeller, F.: Checking Regular Properties of Petri Nets, Proc. Concur, LNCS 962 (1995) 348-362
10. Badouel, E., Darondeau, Ph.: Dualities between nets and automata induced by schizophrenic objects. Proc. CTCS, LNCS 953 (1995) 24-43
11. Desel, J., Reisig, W.: The Synthesis Problem of Petri Nets. Acta Informatica 33 (1996) 297-315
12. Badouel, E., Darondeau, Ph.: Theory of regions. Lectures on Petri Nets I: Basic Models, LNCS 1491 (1998) 529-586
13. Bernardinello, L.: Propriéetés algébriques et combinatoires des régions dans les graphes et leur application á la synthèse de réseaux. Thèse, Univ. Rennes (1998)
14. Darondeau, Ph.: Deriving Unbounded Petri Nets from Formal Languages. Proc. Concur, LNCS 1466 (1998) 533-548
15. Badouel, E.: Automates réversibles et réseaux de Petri, dualité et représentation: le probléme de synthèse. Document d'habilitation 31, Irisa (1999) available from http://www.irisa.fr/EXTERNE/bibli/habilitations.html
16. Caillaud, B.: Bounded Petri-net Synthesis Techniques and their Applications to the Distribution of Reactive Automata. JESA 9-10 no.33 (to appear)
17. Darondeau, Ph.: On the Petri Net Realization of Context-Free Graphs (to appear)
18. Synet: http://www.irisa.fr/pampa/LOGICIELS/synet/synet.html