Adriano Peron

Massimo Benerecetti, Adriano Peron: Timed protocol insecurity problem is NP-complete. Future Generation Comp. Syst. 29(3): 843-862 (2013)

Sergio Di Martino, Adriano Peron, Taro Tezuka (Eds.): Web and Wireless Geographical Information Systems - 11th International Symposium, W2GIS 2012, Naples, Italy, April 12-13, 2012. Proceedings. Lecture Notes in Computer Science 7236, Springer 2012, isbn 978-3-642-29246-0

Laura Bozzelli, Aniello Murano, Adriano Peron: Pushdown module checking. Formal Methods in System Design 36(1): 65-95 (2010)

Massimo Benerecetti, Nicola Cuomo, Adriano Peron: Timed protocols insecurity problem is NP-complete. HPCS 2010: 274-282

Massimo Benerecetti, Stefano Minopoli, Adriano Peron: Analysis of Timed Recursive State Machines. TIME 2010: 61-68

Massimo Benerecetti, Nicola Cuomo, Adriano Peron: TPMC: A Model Checker For Time-Sensitive Security Protocols. JCP 4(5): 366-377 (2009)

Laura Bozzelli, Salvatore La Torre, Adriano Peron: Verification of well-formed communicating recursive state machines. Theor. Comput. Sci. 403(2-3): 382-405 (2008)

Dario Carotenuto, Aniello Murano, Adriano Peron: 2-Visibly Pushdown Automata. Developments in Language Theory 2007: 132-144

Angelo Montanari, Adriano Peron, Gabriele Puppis: On the relationships between theories of time granularity and the monadic second-order theory of one successor. Journal of Applied Non-Classical Logics 16(3-4): 433-456 (2006)

Massimo Franceschet, Angelo Montanari, Adriano Peron, Guido Sciavicco: Definability and decidability of binary predicates for time granularity. J. Applied Logic 4(2): 168-191 (2006)

Laura Bozzelli, Salvatore La Torre, Adriano Peron: Verification of Well-Formed Communicating Recursive State Machines. VMCAI 2006: 412-426

Laura Bozzelli, Aniello Murano, Adriano Peron: Pushdown Module Checking. LPAR 2005: 504-518

Piero A. Bonatti, Adriano Peron: On the undecidability of logics with converse, nominals, recursion and counting. Artif. Intell. 158(1): 75-96 (2004)

Margherita Napoli, Mimmo Parente, Adriano Peron: Specification and Verification of Protocols With Time Constraints. Electr. Notes Theor. Comput. Sci. 99: 205-227 (2004)

Carlo Combi, Massimo Franceschet, Adriano Peron: Representing and Reasoning about Temporal Granularities. J. Log. Comput. 14(1): 51-77 (2004)

Ruggero Lanotte, Andrea Maggiolo-Schettini, Adriano Peron: Structural Model Checking for Communicating Hierarchical Machines. MFCS 2004: 525-536

Ruggero Lanotte, Andrea Maggiolo-Schettini, Adriano Peron, Simone Tini: Dynamic Hierarchical Machines. Fundam. Inform. 54(2-3): 237-252 (2003)

Andrea Maggiolo-Schettini, Adriano Peron, Simone Tini: A comparison of Statecharts step semantics. Theor. Comput. Sci. 290(1): 465-498 (2003)

Massimo Franceschet, Angelo Montanari, Adriano Peron, Guido Sciavicco: Definability and decidability of binary predicates for time granularity. TIME 2003: 192-202

Laura Bozzelli, Massimo Benerecetti, Adriano Peron: Verification of recursive parallel systems. CoRR cs.OH/0312019 (2003)

Angelo Montanari, Adriano Peron, Alberto Policriti: Extending Kamp's Theorem to Model Time Granularity. J. Log. Comput. 12(4): 641-677 (2002)

Carlo Combi, Massimo Franceschet, Adriano Peron: A Logical Approach to Represent and Reason about Calendars. TIME 2002: 134-140

Angelo Monti, Adriano Peron: Logical definability of Y-tree and trellis systolic omega-languages. Acta Cybern. 15(1): 75-100 (2001)

Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini, Adriano Peron: Transformations of Timed Cooperating Automata. Fundam. Inform. 47(3-4): 271-282 (2001)

Ruggero Lanotte, Andrea Maggiolo-Schettini, Adriano Peron: Timed Cooperating Automata. Fundam. Inform. 43(1-4): 153-173 (2000)

Angelo Montanari, Adriano Peron, Alberto Policriti: The Taming (Timing) of the States. Logic Journal of the IGPL 8(5): 681-699 (2000)

Angelo Monti, Adriano Peron: Systolic tree omega-Languages: the operational and the logical view. Theor. Comput. Sci. 233(1-2): 1-18 (2000)

Angelo Montanari, Adriano Peron, Alberto Policriti: Theories of omega-Layered Metric Temporal Structures: Expressiveness and Decidability. Logic Journal of the IGPL 7(1): 79-102 (1999)

Angelo Monti, Adriano Peron: A Logical Characterization of Systolic Languages. STACS 1998: 466-476

Andrea Maggiolo-Schettini, Adriano Peron, Simone Tini: Equivalences of Statecharts. CONCUR 1996: 687-702

Andrea Maggiolo-Schettini, Adriano Peron: Retiming Techniques for Statecharts. FTRTFT 1996: 55-71

Angelo Monti, Adriano Peron: Systolic Tree Omega-Languages. STACS 1995: 131-142

Adriano Peron: Statecharts, Transition Structures and Transformations. TAPSOFT 1995: 454-468

Adriano Peron, Andrea Maggiolo-Schettini: Transitions as Interrupts: A New Semantics for Timed Statecharts. TACS 1994: 806-821

Andrea Maggiolo-Schettini, Adriano Peron: A Graph Rewriting Framework for Statecharts Semantics. TAGT 1994: 107-121

Andrea Maggiolo-Schettini, Adriano Peron: Semantics of Full Statecharts Based on Graph Rewriting. Dagstuhl Seminar on Graph Transformations in Computer Science 1993: 265-279

V. Roberto, Adriano Peron, P. L. Fumis: Low-level processing techniques in geophysical image interpretation. Pattern Recognition Letters 10(2): 111-122 (1989)