Projet Paragraphe
Précédent : Diffusion des résultats
Remonter : Projet PARAGRAPHE, Parallélisme et
graphes
- Ouvrages et articles de référence
de l'équipe
- 1
- E. BADOUEL, L.
BERNARDINELLO, P.
DARONDEAU,
« Polynomial algorithms for the synthesis of bounded nets
»,
in: CAAP'95 , 915 , Springer Verlag LNCS, p.
364-378,
Aarhus, 1995.
- 2
- E. BADOUEL, L.
BERNARDINELLO, P.
DARONDEAU,
« The synthesis problem for elementary net systems is
NP-complete »,
TCS 186 , 1997, p. 107-134.
- 3
- E. BADOUEL, P.
DARONDEAU, J.-C.
RAOULT,
« Context-free event domains are recognizable »,
Information and Computation , 2000,
à paraître (une version préliminaire est parue comme rapport de
recherche Inria, no 2588).
- 4
- E. BADOUEL, P.
DARONDEAU,
« Dualities between nets and automata induced by shizophrenic
objects »,
in: CTCS'95 , 953 , Springer Verlag LNCS, p.
24-43,
Cambridge, 1995.
- 5
- E. BADOUEL, P.
DARONDEAU,
« Trace nets and process automata »,
Acta Informatica 32(7) , 1995, p. 647-681.
- 6
- D. CAUCAL,
« Monadic theory of term rewriting »,
in: 7th IEEE Symp., LICS , IEEE, p. 266-273,
Santa Cruz, 1992.
- 7
- D. CAUCAL,
« On the regular structure of prefix rewriting »,
TCS 106 , 1992, p. 61-86.
- 8
- D. CAUCAL,
« Bisimulation of context-free grammars and of pushdown
automata »,
in: Modal logic and process algebra , 53
,
Stanford University CSLI Lecture Notes, 1995, p. 85-106.
- 9
- D. CAUCAL,
« On infinite transition graphs having a decidable monadic
theory »,
in: ICALP'96 , 1099 , Springer Verlag LNCS,
p. 194-205,
Paderborn, 1996.
- 10
- V. SCHMITT,
« Flip-Flop Nets »,
in: STACS'96 , 1046 , Springer Verlag LNCS,
p. 517-528,
1996.
- Thèses et habilitations à diriger
des recherches
- 11
- V. SCHMITT,
Représentations finies de comportements concurrents
,
thèse de doctorat, université de Rennes 1, janvier 1997.
- Articles
- 12
- D. CAUCAL,
« On infinite transition graphs having a decidable monadic
theory »,
TCS , 1997,
à paraître.
- 13
- V. SCHMITT,
« Stable automata vs full trace automata »,
TCS , 1997,
à paraître.
- Communications à des manifestations
scientifiques
- 14
- E. BADOUEL, P.
DARONDEAU,
« Stratified Petri nets »,
in: FCT'97 , 1279 , Springer-Verlag LNCS, p.
117-128,
Krakow, 1997.
- Rapports de
recherche
- 15
- E. BADOUEL, P.
DARONDEAU,
« On the synthesis of general Petri nets »,
rapport de recherche No3025, Inria, novembre 1996.
- 16
- E. BADOUEL,
« Splitting of Actions, Higher-Dimensional Automata and Net
Synthesis »,
rapport de recherche No3013, Inria, octobre 1996.
- Divers
- 17
- E. BADOUEL, P.
DARONDEAU,
« Theory of regions », 1997,
chapître d'un livre en cours d'édition.
- Bibliographie
générale
- ABCR94
- M.R. Assous, V. Bouchitté, C. Charreton, and B. Rozoy.
Finite labelling problem in event structures.
TCS, 123, 1994.
- BD92
- E. Badouel and Ph. Darondeau.
Trace nets.
In Proc. REX workshop ``Semantics: Foundations and
Applications'', number 666. Springer Verlag LNCS,
1992.
- BD94
- F. Bracho and M. Droste.
Labelled domains and automata with concurrency.
TCS, 135, 1994.
- Bed87
- M. Bednarczyk.
Categories of asynchronous systems.
PhD thesis, university of Sussex, 1987.
- BM97
- R. Bruni and U. Montanari.
Zero-safe nets, or transition synchronization made simple.
In Proc. Express 97. Electronic Notes in Theoretical
Computer Science, 1997.
- BMPV96
- L. Bernardinello, G. De Michelis, K. Petruni, and S.
Vigna.
On the synchronic structure of transition systems.
In Structures in Concurrency Theory. Springer Verlag,
1996.
- Cou90
- B. Courcelle.
Graph rewriting: an algebraic and logic approach.
Elsevier, 1990.
- DR96
- J. Desel and W. Reisig.
The synthesis problem of petri nets.
Acta Informatica, 33, 1996.
- Dro90
- M. Droste.
Concurrency, automata and domains.
In Proc. ICALP, number 443. Springer Verlag LNCS,
1990.
- EKR95
- C. Ellis, K. Keddara, and G. Rozenberg.
Dynamic change within workflow systems.
In Proc. Conference on Organizational Computing
Systems. ACM Press, 1995.
- ER90a
- A. Ehrenfeucht and G. Rozenberg.
Partial (set) 2-structures; part 1: basic notions and
the representation problem.
Acta Informatica, 27, 1990.
- ER90b
- A. Ehrenfeucht and G. Rozenberg.
Partial (set) 2-structures; part 2: state spaces of
concurrent systems.
Acta Informatica, 27, 1990.
- Gou95
- E. Goubault.
The Geometry of Concurrency.
PhD thesis, École Normale Supérieure, Paris, 1995.
- Hau90
- D. Hauschildt.
Semilinearity of the Reachability Set is Decidable for
Petri Nets.
PhD thesis, université de Hambourg, April 1990.
- HITZ95
- S. Haddad, J. Ilié, M. Taghelit, and B. Zouari.
Symbolic reachability graph and partial symmetries.
In Proc. ICATPN, number 935. Springer Verlag LNCS,
1995.
- HKT92
- P. Hoogers, H. Kleijn, and P. Thiagarajan.
A trace semantics for petri nets.
In Proc. ICALP, number 623. Springer Verlag LNCS,
1992.
- HKT96
- P. Hoogers, H. Kleijn, and P. Thiagarajan.
An event structure semantics for general petri nets.
TCS, 153, 1996.
- Jen92
- K. Jensen.
Coloured Petri Nets. Basic Concepts, Analysis Methods and
Practical Use, Volume 1, Basic Concepts.
EATCS-Monographs, Springer Verlag, 1992.
- Kel74
- G.M. Kelly.
Doctrinal adjunction.
Springer Verlag LNM, 1974.
- KM69
- R.M. Karp and R.E. Miller.
Parallel program schemata.
JCSS, 3, 1969.
- Kus94
- D. Kuske.
Non deterministic automata with concurrency relations.
In Proc. ICALP, number 787. Springer Verlag LNCS,
1994.
- May84
- E.W. Mayr.
An algorithm for the general petri net reachability
problem.
Siam J. Comput., 13, 1984.
- MR80
- G. Memmi and G. Roucairol.
Linear algebra in net theory.
In Proc. Net Theory and Applications, number 84.
Springer Verlag LNCS, 1980.
- MS85
- D. Müller and P. Schupp.
The theory of ends, pushdown automata, and second order
logic.
TCS, 37, 1985.
- Muk92
- M. Mukund.
Petri nets and step transition systems.
IJFCS, 3(4), 1992.
- Mur89
- T. Murata.
Petri nets: Properties, analysis and applications.
Proc. IEEE, 77(4), 1989.
- NPW81
- M. Nielsen, G. Plotkin, and G. Winskel.
Petri nets, event structures and domains.
TCS, 13, 1981.
- NW94
- M. Nielsen and G. Winskel.
Models for Concurrency.
Oxford University Press, 1994.
- Rab69
- M. Rabin.
Decidability of second-order theories and automata on infinite
trees.
Trans. AMS, 141, 1969.
- Rei91
- W. Reisig.
Petri nets and algebraic specifications.
TCS, 80, 1991.
- SB94
- C. Sibertin-Blanc.
Cooperative nets.
In Proc. ICATPN, number 815. Springer Verlag LNCS,
1994.
- Sén97
- G. Sénizergues.
The equivalence problem for deterministic pushdown automata is
decidable.
In Proc. ICALP, number 1256. Springer Verlag LNCS,
1997.
- STC97
- M. Silva, E. Teruel, and J.M. Colom.
Linear algebraic techniques for the analysis of net systems,
1997.
3rd advanced course on Petri nets.
- Val78
- R. Valk.
Self-modifying nets, a natural extension of petri nets.
In Proc. ICALP, number 62. Springer Verlag LNCS,
1978.
- Vau86
- J. Vautherin.
Non-linear invariants for coloured petri nets with
interdependent tokens; application to the proof of parallel
programs.
In Advances in Petri nets 1985, number 222. Springer
Verlag LNCS, 1986.
- Vau87
- J. Vautherin.
Parallel systems specification with coloured petri nets and
algebraic abstract data types.
In Proc. 7th European Workshop on ATPN, number 266.
Springer Verlag LNCS, 1987.
- vdA97
- W.M.P. van der Aalst.
Verification of workflow nets.
In Proc. ICATPN, number 1248. Springer Verlag LNCS,
1997.
- Wal81
- R.F.C. Walters.
Sheaves and cauchy-complete categories.
Cahiers de topologie et de géomètrie différentielle,
22(3), 1981.