![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Adriano Peron 14 Andrea Maggiolo-Schettini , Adriano Peron, Simone Tini : A comparison of Statecharts step semantics. TCS 290 (1): 465-498 (2003) 13 Carlo Combi , Massimo Franceschet , Adriano Peron: A Logical Approach to Represent and Reason about Calendars. TIME 2002 : 134-140 12 Angelo Monti , Adriano Peron: Logical definability of Y-tree and trellis systolic omega-languages. Acta Cybernetica 15 (1): 75-100 (2001) 11 Ruggero Lanotte , Andrea Maggiolo-Schettini , Simone Tini , Adriano Peron: Transformations of Timed Cooperating Automata. Fundamenta Informaticae 47 (3-4): 271-282 (2001) 10 Ruggero Lanotte , Andrea Maggiolo-Schettini , Adriano Peron: Timed Cooperating Automata. Fundamenta Informaticae 43 (1-4): 153-173 (2000) 9 Angelo Monti , Adriano Peron: Systolic tree omega-Languages: the operational and the logical view. TCS 233 (1-2): 1-18 (2000) 8 Angelo Monti , Adriano Peron: A Logical Characterization of Systolic Languages. STACS 1998 : 466-476 7 Andrea Maggiolo-Schettini , Adriano Peron, Simone Tini : Equivalences of Statecharts. CONCUR 1996 : 687-702 6 Andrea Maggiolo-Schettini , Adriano Peron: Retiming Techniques for Statecharts. FTRTFT 1996 : 55-71 5 Angelo Monti , Adriano Peron: Systolic Tree Omega-Languages. STACS 1995 : 131-142 4 Adriano Peron: Statecharts, Transition Structures and Transformations. TAPSOFT 1995 : 454-468 3 Adriano Peron, Andrea Maggiolo-Schettini : Transitions as Interrupts: A New Semantics for Timed Statecharts. TACS 1994 : 806-821 2 Andrea Maggiolo-Schettini , Adriano Peron: A Graph Rewriting Framework for Statecharts Semantics. TAGT 1994 : 107-121 1 Andrea Maggiolo-Schettini , Adriano Peron: Semantics of Full Statecharts Based on Graph Rewriting. Dagstuhl Seminar on Graph Transformations in Computer Science 1993 : 265-279 ![]() DiSC'03 © 2003 Association for Computing Machinery |