[KPP09] | C. Kaiser et J.-F. Pradat-Peyre. Concurrent Program metrics drawn by QUASAR. In 14th Int. Conf on Reliable Software Technologie, Brest, France, June 2009, pp. 80-104, LNCS 5570. Related material available on the Quasar Website . |
[HKPPPT09] | S. Haddad, F. Kordon, L. Petrucci, J.F. Pradat-Peyre, and N. Trèves. Efficient state-based analysis by introducing bags in Petri nets colour domains. In Proc. American Control Conference (ACC2009), St Louis, Missouri, USA, June 2009 |
[GPP09a] | C. Girault et J.-F. Pradat-Peyre. High Level Petri Nets. In Petri Nets: Fundamental Models, Verification and Applications , Wiley-ISTE, ISBN: 978-1-84821-079-0, 2009. |
[GPP09b] | C. Girault et J.-F. Pradat-Peyre. Analysis of High Level Petri Nets. In Petri Nets: Fundamental Models, Verification and Applications , Wiley-ISTE, ISBN: 978-1-84821-079-0, 2009. |
[PPP09] | J.-F. Pradat-Peyre et J. Printz. Pratique des tests logiciels Concevoir et mettre en oeuvre une stratégie de tests. Préparation à la certification ISTQB. Dunod, Collection InfoPro, ISBN : 978-2-10052-674-1, 2009. Apperçu en ligne Pratique des Tests Logiciels . |
[KPP09] | C. Kaiser, C. Pajault et J.-F. Pradat-Peyre. Concurrent Program metrics drawn by QUASAR. In 13th Int. Conf on Reliable Software Technologie, Venice, Italy, June 2008, pp. 101-114, Springer Verlag, 2008. Related material available on the Quasar Website . |
[PPPR08] | C. Pajault, J.-F. Pradat-Peyre et P. Rousseau. Adapting Petri Nets Reductions to Promela Specification. In FORTE 2008, 28th IFIP WG 6.1 International Conference, Tokyo, Japan, June 10-13, 2008, pp. 169-184, LNCS 5048, 2008. |
[KPP07] | C. Kaiser, C. Pajault et J.-F. Pradat-Peyre. Modelling remote concurrency with Ada. Case study of symmetric non-deterministic rendez-vous . In Proceedings 12th International Conference on Reliable Software Technologies, Ada-Europe07, LNCS 4498, pp. 192-207, Springer Verlag, 2007. Related material available on the Quasar Website http://quasar.cnam.fr/files/concurrency_papers.html. (télécharger) (ref. CEDRIC 1197) |
[EPP07] | S. Evangelista, C. Pajault et J.-F. Pradat-Peyre. A simple positive flows computation algorithm for a large subclass of colored nets . In Proceedings 27th IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distrib, 2007. (télécharger) (ref. CEDRIC 1196) |
[KPP07b] | C. Kaiser, C. Pajault et J.-F. Pradat-Peyre. Concurrent program metrics drawn by QUASAR numbers . Rapport scientifique CEDRIC No 1315, pp. 18, 2007. Related material available on the Quasar Website http://quasar.cnam.fr/files/concurrency_papers.html. Submitted to Int. Conf. on Reliable Technologies 2008. (télécharger) (ref. CEDRIC 1315) |
[KPE06] | C. Kaiser, J.-F. Pradat-Peyre, S. Evangelista et P. Rousseau. Comparing Java, C# and Ada Monitors queuing policies : a case study and its refinement . Ada Letters, 26(2): 15 pages, ACM, 2006. Related material available on the Quasar Website http://quasar.cnam.fr/files/concurrency_papers.html. (télécharger) (ref. CEDRIC 1004) |
[HP06] | S. Haddad et J.-F. Pradat-Peyre. New Efficient Petri Nets Reductions for Parallel Programs Verification . Parallel Processing Letters, 16(1), 2006. to appear, (15 pages). (ref. CEDRIC 982) |
[NPV06] | E. Najm, J.-F. Pradat-Peyre et V. Viguié Donzeau-Gouge. FORTE'06: Formal Techniques for Networking and Distributed Systems . In Paris, Canm, 26-29, September, 2006. (ref. CEDRIC 1094) |
[PP06] | C. Pajault et J.-F. Pradat-Peyre. Distributed colored Petri net model-checking with Cyclades . In Proceedings Parallel and Distributed Methods in verifiCation (PDMC) 2006, 2006. (ref. CEDRIC 1065) |
[EP06] | S. Evangelista et J.-F. Pradat-Peyre. On the Computation of Stubborn Sets of Colored Petri Nets . In Proc. 27th Intl. Conf. on the Application and Theory of Petri Nets and Other Models of Concurrency, pp. 146--165, S. Donatelli and P.S. Thiagara, 2006. (ref. CEDRIC 998) |
[KPP06] | C. Kaiser, C. Pajault et J.-F. Pradar-Peyre. Modelling remote concurrency with Ada.Case study of symmetric non-deterministic rendez-vous. . Rapport scientifique CEDRIC No 1102, pp. 15, 2006. Related material available on the Quasar Website http://quasar.cnam.fr/files/concurrency_papers.html Submitted to 12th Int Conf on Reliable Software Technologie Geneva 2007. (télécharger) (ref. CEDRIC 1102) |
[KP06] | C. Kaiser et J.-F. Pradat-Peyre.. Noyau de concurrence par moniteur pour Java ou C#: pour une autre sémantique plus fiable et plus performante . Rapport scientifique CEDRIC No 1021, pp. 12 pages, 2006. Related material available on the Quasar Website http://quasar.cnam.fr/files/concurrency_papers.html. (télécharger) (ref. CEDRIC 1021) |
[PP06b] | C. Pajault et J.-F. Pradat-Peyre. Static Reductions for Promela Specifications . Rapport scientifique CEDRIC No 1005, 2006. (télécharger) (ref. CEDRIC 1005) |
[EKP05] | S. Evangelista, C. Kaiser, C. Pajault, J.-F. Peyre et P. Rousseau. Dynamic tasks verification with Quasar . In 10th International Conference on Reliable Software Technologies Ada-Europe 2005, pp. 91-104, LNCS 3555, 2005. (ref. CEDRIC 699) |
[EHP05] | S. Evangelista, S. Haddad et J.-F. Pradat-Peyre. Syntactical Colored Petri Nets Reductions . In Automated Technology for Verification and Analysis (ATVA) 2005, pp. 202-216, LNCS 3707, D.A. Peled, Y.-K. T, 2005. (ref. CEDRIC 839) |
[EP05] | S. Evangelista et J.-F. Peyre. Memory Efficient State Space Storage in Explicit Software Model Checking . In SPIN'05, pp. 43-57, LNCS 3639, P. Godefroid, 2005. (ref. CEDRIC 834) |
[EP04] | S. Evangelista et J.-F. Pradat-Peyre. An Efficient Algorithm for the Enabling Test of Colored Petri Nets . In 5th Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, Aarhus, October, pp. 137-156, K. Jensen, 2004. (ref. CEDRIC 675) |
[EHP04] | S. Evangelista, S. Haddad et J.-F. Pradat-Peyre. New Coloured Reductions for Software Validation . In Workshop on Discrete Event Systems, Reims, 22-24 September, pp. 355-360, J.Zaytoon, V.Carre-Menetrier, 2004. (ref. CEDRIC 655) |
[PRI04] | J. Printz & Jean-François Pradat-Peyre. Génération automatique de jeux de tests et contraintes d'utilisation d'un logiciel . Génie logiciel, 0(68): 45-52, GL & IS, 2004. (ref. CEDRIC 645) |
[ROU04] | P. Rousseau. Découpe de programmes concurrents avec Quasar . In ICSSEA, 2004. (ref. CEDRIC 677) |
[EP04b] | S. Evangelista et J.-F. Pradat-Peyre. A Semi-Explicit Method to Store State Spaces in a Compact Way . Rapport scientifique CEDRIC No 682, 2004. (télécharger) (ref. CEDRIC 682) |
[NPV04] | S. Natkin, J.-F. Pradat-Peyre et L. Vega. Un Modèle basé sur les Réseaux de Petri pour l'analyse de l'ordonnancement des actions dans un jeu vidéo. . Rapport scientifique CEDRIC No 635, 2004. (ref. CEDRIC 635) |
[HP04] | S. Haddad et J.-F. Pradat-Peyre. Efficient Reductions for LTL Formulae Verification . Rapport scientifique CEDRIC No 634, 2004. (télécharger) (ref. CEDRIC 634) |
[PP04] | J.-F. Pradat-Peyre et J. Printz. Automatic Test Generation and Information Systems Interoperability . Divers, Ministère de la défense, Minit, 2004. (télécharger) (ref. CEDRIC 691) |
[EKP03] | S. Evangelista, C. Kaiser, J.F. Pradat-Peyre et P. Rousseau. Verifying Linear Time Temporal Logic Properties of Concurrent Ada Programs with Quasar . Ada Letter, 24(1): 17-24, ACM Press, 2003. (ref. CEDRIC 516) |
[KP03] | C. Kaiser et J.-F. Pradat-Peyre. Chameneos, a Concurrency Game for Java, Ada and Others . In ACS/IEEE International Conference on Computer Systems and Applications,, pp. 8 pages, IEEE IEEE Book of Abstracts. A, 2003. ACS/IEEE International Conference on Computer Systems and Applications, 2003 14-18 July 2003 Page(s):62 Digital Object Identifier 10.1109/AICCSA.2003.1227495. (télécharger) (ref. CEDRIC 474) |
[EKP03b] | S. Evangelista, C. Kaiser, J.F. Pradat-Peyre et P. Rousseau. Quasar : A New Tool for Concurrent Ada Programs Analysis . In International Conference on Reliable Software Technologies, Ada-Europe'03, Toulouse, France, juin, pp. 166-181, LNCS 2655, Springer-Verlag, J., 2003. Take a look at the Quasar Web pages . (ref. CEDRIC 447) |
[PP02] | J. Printz et J.-F. Pradat-Peyre. Utilisation de contraintes pertinentes pour la génération automatique de jeux de tests . Rapport scientifique CEDRIC No 412, 2002. Rapport final de la seconde phase de l'opération 4 de l'action FORMA en partenariat avec THALES Airborn Systems; financement DGA, contrat 99-34-027 passé par le service des stratégies techniques et des technologies communes de la direction des systèmes de forces et de la prospective. Accecpté pour publication dans la revue "Génie Logiciel", numéro 68, Mars 2004. (ref. CEDRIC 412) |
[PRA02] | J.-F. Pradat-Peyre. Application des réseaux de Haut-Niveau à la vérification automatique de programmes Ada95 concurrents . Chapitre de livre, Hermes, 2002. "Vérification et Mise en Oeuvre des Réseaux de Petri"; Traité IC2 - Série Informatique et systèmes d'information Edition Hermes - . (ref. CEDRIC 413) |
[PRA01] | J.-F. Pradat-Peyre. Analyse des réseaux de Petri de haut-niveau . Chapitre de livre, 2001. "Les réseaux de Petri: Modèles Fondamentaux", Traité IC2 - Série Informatique et systèmes d'information Edition Hermes - 394 pages - 01/05/01 - ISBN : 2-7462-0250-6. (ref. CEDRIC 132) |
[GP01] | C. Girault et J.-F. Pradat-Peyre. Les réseaux de Petri de haut-niveau . Chapitre de livre, Hermes, 2001. "Les réseaux de Petri: Modèles Fondamentaux", Traité IC2 - Série Informatique et systèmes d'information Edition Hermes - 394 pages - 01/05/01 - ISBN : 2-7462-0250-6. (ref. CEDRIC 131) |
[PP00] | D. Poitrenaud et J.-F. Pradat-Peyre. Pre and Post-Agglomerations and LTL Model Checking . In International Conference on Application and Theory of Petri Nets (ICATPN 2000), pp. 387-408, LNCS 1825, Springer-Verlag, Ni, 2000. pages 387-408.. (ref. CEDRIC 63) |
[BP99] | E. Bruneton et J.-F. Pradat-Peyre. Automatic Verification of Concurrent Ada Programs . In Reliable Software Technologies-Ada-Europe'99, LNCS 1622, Springer-Verlag, 1999. (ref. CEDRIC 219) |
[BP98] | K. Barkaoui et J.-F. Pradat-Peyre. Verification in Concurrent Programming with Petri nets Structural Techniques . In Third IEEE International High-Assurance Systems Engineering Symposium, Nov. 13 - 14, pp. 124-133, IEEE Computer Society Press, 1998. (télécharger) (ref. CEDRIC 416) |
[KP98] | C. Kaiser et J.-F. Pradat-Peyre. Reliable, Fair and Efficient Concurrent Software with Dynamic Allocation of Identical Resources . In MCSEAI'98, 1998. (télécharger) (ref. CEDRIC 415) |
[BKP97] | K. Barkaoui, C. Kaiser et J.-F. Pradat-Peyre. Petri nets based proofs of Ada 95 solution for preference control . In APSEC '97 / ICSC '97, 1997. (ref. CEDRIC 419) |
[KP97] | C. Kaiser et J.-F. Pradat-Peyre. Comparing the Reliability Provided by Tasks or Protected Objects for Implementing a Resource Allocation Service : a Case Study . In Tri-Ada'97, 1997. (télécharger) (ref. CEDRIC 414) |
[PP97] | J.-F. Pradat-Peyre et J. Printz. Utilisation de contraintes pertinentes pour la génération automatqiue de jeux de test . In IGL'97, 1997. (télécharger) (ref. CEDRIC 417) |
[BP96] | K. Barkaoui et J.-F. Pradat-Peyre. On Liveness and Controlled Siphons in Petri Nets . In International Conference in Application and Theory of Petri Nets (ICATPN'96), LNCS 1091, Springer-Verlag, 1996. Osaka, Japan, pages 57-72. (télécharger) (ref. CEDRIC 418) |
[BP94] | K. Barkaoui et J.F. Peyre. Combining Linear Programming and Graph Analysis for Petri Nets Validation . In 7th SIAM Conference on Discrete Mathematics, 1994. (ref. CEDRIC 476) |
[CHP93] | J.-M. Couvreur, S. Haddad et J.-F. Peyre. Generative families of positive invariants in Coloured nets sub-classes . Advanced in Petri Nets, 674(0), Rozenberg, G., LNCS, 1993. pages 51-70. (ref. CEDRIC 421) |
[PEY93] | J.-F. Peyre. A New Prototyping Method of Massively Parallel Application using Colored Petri-Nets . In NATUG6 -Transputer Research and Applications 6, S. Atkins and A.S. Wagner Eds, 1993. (ref. CEDRIC 477) |
[BP93] | F. Bréant et J.F. Peyre. OCCAM Prototyping of Massively Parallel Applications using colored Petri Nets . In 7th IEEE Int. Parallel Processing Symposium, 1993. (ref. CEDRIC 475) |
[CHP92] | J.-M. Couvreur, S. Haddad et J.-F. Peyre. Résolution paramétrée de familles de systèmes linéaires . RAIRO, Operation Research, 26(2), 1992. (ref. CEDRIC 422) |
[KP91] | F. Kordon et J.F. Peyre. Process decomposition for Rapid Prototyping of Parallel systems . In 6th International Symposium on Computer and Information Science, 1991. (ref. CEDRIC 478) |
[CHP91] | J.-M. Couvreur, S. Haddad et J.-F. Peyre. Computation of Generative Families of Positive Semi-Flows in Two Types of Coloured Nets . In 12th International Conference on Application and Theory of Petri Nets, Jun, Springer-Verlag, 1991. (télécharger) (ref. CEDRIC 420) |