Most of my publications can be retrieved on the Internet (see DBLP for more).
  • DELLA MONICA D., NAPOLI M., PARENTE M., Model Checking Coalitional Games in shortage resource scenarios. GandALF 2013. agosto 2013, G. Puppis, T. Villa Ed., EPTCS, 2013.
  • MONTANARI A., NAPOLI M., PARENTE M., Preface of the first Symposium on Games, Automata, Logics, and Formal Verification, GandALF. In: International Jounal of Foundations of Computer Science 23(3) (2012).
  • DELLA MONICA D., NAPOLI M., PARENTE M., On a Logic for Coalitional Games with Priced-Resource Agents. In: Electronic Notes in Theoretical Computer Science, ENTCS, (vol.278), 215-228, 2011. 7th Workshop on Methods for Modalities (M4M 2011) and the 4th Workshop on Logical Aspects of Multi-Agent Systems (LAMAS 2011).
  • DELLA MONICA D., NAPOLI M., PARENTE M., Coalitional Games with Priced-Resource Agents. In: 26-esimo Convegno Italiano di Logica Computazionale. Pescara, agosto 2011, Fabio Fioravanti Ed. , CILC 2011, CEUR Workshop Proceedings, (vol. 810), 341-347; 2011.
  • NAPOLI M., PARENTE M., Graded CTL Model Checking for Test Generation. Symposium On Theory of Modeling and Simulation - DEVS Integrative M&S Symposium (TMS/DEVS 2011) Boston, MA, USA, April 4-9, 2011. http://arxiv.org/abs/1111.2768v1
  • FAELLA M., NAPOLI M., PARENTE M., Graded Alternating-Time Temporal Logic. FUNDAMENTA INFORMATICAE, vol. 105(1-2); 189-210; (2010).
  • FERRANTE A., MEMOLI M., NAPOLI M., PARENTE M., SORRENTINO F., A NuSMV Extension for Graded-CTL Model Checking. In: L.N.C.S. (vol. 6174), 670--673, Springer. Computer Aided Verification, 22nd International Conference, CAV 2010, Edinburgh, UK, July 15-19, 2010.
  • FAELLA M., NAPOLI M., PARENTE M., Graded Alternating-Time Temporal Logic. In: L.N.C.S. (vol. 6355) 189--210, Springer. Dakar, Senegal, 25/05/2010-01/06/2010, LPAR 2010.
  • CELANO G., PALESE A.M., PARENTE M., RIZZUTI L., SILVESTRI N., Environmental Impact Evaluation of Olive Mill Wastewater Shedding on Cultivated Fields. TERRESTRIAL & AQUATIC ENVIRONMENTAL TOXICOLOGY, vol. 4; 39--54,(2010).
  • FERRANTE A., NAPOLI M., PARENTE M., Model-Checking for Graded CTL. FUNDAMENTA INFORMATICAE, vol. 96(3); 323-339; (2009).
  • FAELLA M., NAPOLI M., PARENTE M. Graded Alternating-time temporal logc. In: 24-esimo Convegno Italiano di Logica Computazionale. Ferrara, giugno 2009, FERRARA: Marco Gavanelli and Fabrizio Riguzzi, CILC 2009, 1-15; (2009).
  • FERRANTE A., NAPOLI M., PARENTE M. Graded-CTL: Satisfiability and Symbolic Model Checking. In: Lecture Notes in Computer Science (L.N.C.S.), Rio de Janeiro, Brasil, 09/12/2009-12/12/2009, Springer-Verlag, vol. 5885; ICFEM 2009, 306-325; (2009).
  • FERRANTE A., NAPOLI M., PARENTE M. CTL Model-Checking with Graded Quantifiers. In: Lecture Notes in Computer Science, L.N.C.S. Seoul, South Korea, 20/10/2008-23/10/2008, Springer-Verlag, vol. 5311; ATVA 2008, 18-32; I(2008).
  • MURANO A., NAPOLI M., PARENTE M., Program Complexity in Hierarchical Module Checking. In: Lecture Notes in Computer Science. Doha, Qatar, 22/11/2008-27/11/2008, Springer-Verlag, LPAR 2008, 318-332; (2008).
  • FERRANTE A., NAPOLI M., PARENTE M., Graded CTL Model-Checking. In: 23-esimo Convegno Italiano di Logica Computazionale. Perugia, 10-12 luglio 2008; Perugia, CILC 2008, 1-15; (2008).
  • FERRANTE A., MURANO A., PARENTE M., Enriched mu-calculi module checking. LOGICAL METHODS IN COMPUTER SCIENCE, vol. 4; 1-27; (2008).
  • PARENTE M., FERRANTE A., Mixed Nash Equilibria in selfish routing problems with dynamic constraints. THEORETICAL COMPUTER SCIENCE, vol. 393; 37-53; (2008).
  • LA TORRE S., NAPOLI M., PARENTE M., PARLATO G., Verification of Scope-dependent Hierarchical State Machines. INFORMATION AND COMPUTATION, vol. 206; 1161-1177; (2008).
  • GRUSKA J.,LA TORRE S., PARENTE M., The firing squad synchronization problem on squares, toruses and rings. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, vol. 18; 637-654; (2007).
  • LA TORRE S., NAPOLI M., PARENTE M., The word problem for visibly pushdown languages described by grammars. FORMAL METHODS IN SYSTEM DESIGN, vol. 31; 265-279; (2007).
  • FERRANTE A., MURANO A., PARENTE M., Enriched mu-Calculus Pushdown Module Checking. In: Int.Conf. on Logic for Programming, Artificial Intelligence and Reasoning 2007. Yerevan, Armenia, 15--19 Ottobre 2007. L.N.C.S., vol. 4790, LPAR 2007, 438-453; (2007).
  • LA TORRE S., NAPOLI M., PARENTE M., PARLATO G. Verification of Succinct Hierarchical State Machine. In: 1st International Conference on Language and Automata Theory and Applications. Tarragona, Spain, 29/03/2007 - 04/04/2007, TARRAGONA: Universitat Rovira i Virgili, LATA 2007, 485-496; (2007).
  • LA TORRE S., NAPOLI M., PARENTE M., On the Membership Problem for Visibly Pushdown Languages. In: Proc. of the 4th International Symposium on Automated Technology for Verification and Analysis (ATVA 2006). Lecture Notes in Computer Science. Bejing, China, 23-26 Ottobre 2006, BERLIN: SPRINGER, vol. 4218, 96-109; (2006).
  • GRUSKA J., LA TORRE S., NAPOLI M., PARENTE M., Different Time Solutions for the Firing Squad Synchronization Problem on Basic Grid Networks. RAIRO THEORETICAL INFORMATICS AND APPLICATIONS, vol. 40(2); 177-206; (2006).
  • GRUSKA J., LA TORRE S., NAPOLI M., PARENTE M. Various Solutions to the Firing Squad Synchronization Problems. In: CoRR cs.DS/0511044, 1-24; (2005).
  • FERRANTE A., PARENTE M. Existence of Nash Equilibria in Selfish Routing Problems. In: Structural Information and Communication Complexity. Smolenice Castle, Slovakia, 21-23 June 2004, vol. LNCS 3104, SIROCCO 2004, 149-160; (2004).
  • GRUSKA J., LA TORRE S., PARENTE M. Optimal Time and Communication Solutions of Firing Squad Synchronization Problems on Square Arrays, Toruses and Rings. In: Developments in Language Theory. Auckland, New Zealand, 13-17 December 2004, vol. LNCS 3340, DLT 2004, 200-211; (2004).
  • LA TORRE S., MURANO A., PARENTE M., Model-checking the Secure Release of a Time-Locked Secret Over a Network. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, vol. 99; 229-243; (2004).
  • NAPOLI M., PARENTE M., PERON A., Specification and Verification of Protocols With Time Constraints. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, vol. 99; 205-227; (2004).
  • PARENTE M., FERRANTE A., On the Vertex-Connectivity Problem for Graphs with Sharpened Triangle Inequality. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, vol. 15(5); 701-715; (2004).
  • PARENTE M., CATUOGNO L., CATTANEO G., FERRARO U., PERSIANO G., FRESA A. Integrated Management in Telecommunications Management Network. In: International Conference on Software, Telecommunications and Computer Networks (SoftCOM 2003). Split, Dubrovnik (Croatia), 07-10 Ottobre 2003, 1-10; (2003).
  • PARENTE M., FERRANTE A., An Approximation Algorithm for the Minimum Weight Vertex-Connectivity Problem in Complete Graphs with Sharpened Triangle Inequality. In: Theoretical Computer Science. Bertinoro (FC), Italy, 13-15 Ottobre 2003, vol. LNCS 2841, ICTCS 2003 137-149; (2003).
  • PARENTE M., LA TORRE S., NAPOLI M., PARLATO G. Hierarchical and Recursive State Machine with Context-Dependent Properties. In: Automata, Languages and Programming. Eindhoven, The Netherlands, June 30 - July 4, 2003, vol. LNCS 2719, ICALP 2003, 776-789; (2003).
  • PARENTE M., NAPOLI M., LA TORRE S., Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints. In: Universal Machines and Computations. Chisinau, Moldavia, Maggio 2001, vol. LNCS 2005, MCU 2001, 264-275; (2001).
  • PARENTE M., NAPOLI M., LA TORRE S., Compositionality in the Synchronization of Processors Exchanging a minimal amount of Information. In: Proceedings of 5th WSDAAL, 18-20 Settembre, Ischia, Italia, 1-10; (2000).
  • LA TORRE S., NAPOLI M., PARENTE M., A Compositional Approach to Synchronize Two Dimensional Networks of Processor. RAIRO. THEORETICAL INFORMATICS AND APPLICATIONS, vol. 34(6); 549-564; (2000).
  • AULETTA V., PARENTE M., 2-Approximation Algorithm for Finding an Optimum 3 - Vertex - Connected Spanning Subgraph. JOURNAL OF ALGORITHMS, vol. 32 (1); 21-30, (1999).
  • AULETTA V., MONTI A, PARENTE M., PERSIANO G., A Linear Time Algorithm for the Feasibility of Pebble Motion on Trees. ALGORITHMICA, vol. 23(3); 223-245; (1999).
  • PARENTE M., AULETTA V., DINITZ Y., NUTOV Z., A 2 Approximation Algorithms for Finding an Optimum 3 Vertex Connected Spanning Subgraph. JOURNAL OF ALGORITHMS, vol. 32; 21-30; (1999).
  • AULETTA V., PARENTE M., PERSIANO G., Placing Resource on a Growing Line. JOURNAL OF ALGORITHMS, vol. 26(1); 87-100; (1998).
  • LA TORRE S., NAPOLI M., PARENTE M., Synchronization of a line of identical processors at a given time. FUNDAMENTA INFORMATICAE, vol. 34(1-2); 103-128; (1998)
  • LA TORRE S., NAPOLI M., PARENTE M., Synchronization of a line of identical processors at a given time. in Proc. of the Colloquium on Trees in Algebra and Programming, CAAP 97, in the framework of the Seventh International Joint Conference on the Theory and Practice of Software Development, TAPSOFT 97, Lille, France, April 14 - 18, 1997. L.N.C.S. 1214, 405-416; (1997).
  • LA TORRE S., NAPOLI M., PARENTE M., Synchronization of 1-way connected processors. COMPLEX SYSTEM, vol. 10(4); 239-255; (1998).
  • LA TORRE S., NAPOLI M., PARENTE M., Synchronization of 1-way connected processors. in Proc. of the 11-th International Symposium on Fundamentals of Computation Theory, FCT 97, Krakow, Poland, September 1--3, 1997. L.N.C.S. 1279, 293-304(1997).
  • AULETTA V., PARENTE M., PERSIANO G., Dynamic and Static Algorithms for Optimal Placement of Resources in a Tree. THEORETICAL COMPUTER SCIENCE, vol. 165; 441-461; (1997).
  • GRUSKA J., MONTI A., NAPOLI M., PARENTE M., Succinctness of Description of SBTA Languages. THEORETICAL COMPUTER SCIENCE, vol. 179; 251-271; (1997).
  • LA TORRE S., NAPOLI M., PARENTE M., Parallel word substitution. FUNDAMENTA INFORMATICAE, vol. 27 (1); 27-36; (1996).
  • AULETTA V., PARENTE M., Better Algorithms for Minimum Weight Vertex-Connectivity Problems. PROC. OF THE 14th SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE. Hansestadt L'ubeck, Germany, February 27 - March 1, 1997, vol. LNCS 1200; STACS 1997, 547-558; (1996).
  • AULETTA V., PARENTE M., PERSIANO G., A New Approach to Optimal Planning of Robot Motion on a Tree with Obstacles. PROC. OF THE 4th ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS, Barcellona, Spain, September 25--27, 1996, vol. LNCS 1136; ESA 1996, 529-545; (1996).
  • AULETTA V., MONTI A., PARENTE M., PERSIANO G., A linear time algorithm for the Feasibility of Pebble Motion on Trees. PROC. OF THE FIFTH SCANDINAVIAN WORKSHOP ON ALGORITHM THEORY, SWAT'96, Reykjavik, Iceland, July 3-5, 1996, vol. LNCS 1097; SWAT 1996, 259-270; (1996).
  • AULETTA V., PARENTE M., PERSIANO G., Placing Resources in a Tree: Dynamic and Static Algorithms. ICALP 1995: 232-243; (1995)
  • FACHINI E., GRUSKA J., NAPOLI M., PARENTE M., Power of Interconnection and of Nondeterminism in Regular Y-Tree Systolic Automata. MATHEMATICAL SYSTEM THEORY, vol. 28(3); 245-266; (1995).
  • GRUSKA J., MONTI A., NAPOLI M., PARENTE M., State Complexity of SBTA Languages. vol. LNCS 911; LATIN 1995; 346-357; (1995).
  • GRUSKA J., NAPOLI M., PARENTE M., Optimization of Systolic Tree Automata. PROC. OF THE 13th WORLD COMPUTER CONGRESS, vol. 1; IFIP 1994, 247-252; (1994).
  • GRUSKA J., NAPOLI M., PARENTE M., On the Minimization and Succintness of Systolic Binary Tree Automata. Sci. Ann. Cuza Univ. 2: 13-26; (1993).
  • FACHINI E., GRUSKA J., NAPOLI M., PARENTE M. Normal Forms and Nondeterminism in Y-Tree Systolic Automata. PROC. OF THE 2nd INTERNATIONAL COLLOQUIUM ON WORDS, LANGUAGES AND COMBINATORICS; 144-155; (1992).
  • FACHINI E., MONTI A., NAPOLI M., PARENTE M. Languages Accepted by Systolic Y-Tree Automata: Structural Characterization. ACTA INFORMATICA, vol. 29; 761-778; (1992).
  • FRANCESE R., PAGLI L., PARENTE M., TALAMO M. A New Model for Large Memories. CALCOLO, A QUARTERLY ON NUMERICAL ANALYSIS AND THEORY OF COMPUTATION, vol. 29; 143-155; (1992).
  • FACHINI E., MONTI A., NAPOLI M., PARENTE M. Systolic Y-Tree Automata: Closure Properties and Decision Problems. PROC. OF THE 8th INTERNATIONAL CONFERENCE, FUNDAMENTALS OF COMPUTATION THEORY, Gosen, Germany, September 9-13, 1991, vol. LNCS 529; FCT 1991, 210-219; (1991).
  • MONTI A., PARENTE M. Systolic Tree with Base Automata. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, vol. 2; 221-236; (1991).
  • MONTI A., PARENTE M. Comparison Results for Particular Systolic Tree Automata. (1990).
  • FACHINI E., FRANCESE R., NAPOLI M., PARENTE M. Systolic Automata on BC-Tree: Characterization and Properties. JOURNAL OF COMPUTERS AND ARTIFICIAL INTELLIGENCE, vol. 8; 53-82; (1989).