The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrea Maggiolo-Schettini: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Simone Tini, Andrea Maggiolo-Schettini
    A Causal Semantics for Timed Default Concurrent Constraint Programming. [Citation Graph (0, 0)][DBLP]
    AMAST, 2000, pp:228-242 [Conf]
  2. Andrea Maggiolo-Schettini, Józef Winkowski
    A Programming Language for Deriving Hypergraphs. [Citation Graph (0, 0)][DBLP]
    CAAP, 1992, pp:221-231 [Conf]
  3. Andrea Maggiolo-Schettini, Adriano Peron, Simone Tini
    Equivalences of Statecharts. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1996, pp:687-702 [Conf]
  4. Andrea Maggiolo-Schettini, Adriano Peron
    Semantics of Full Statecharts Based on Graph Rewriting. [Citation Graph (0, 0)][DBLP]
    Dagstuhl Seminar on Graph Transformations in Computer Science, 1993, pp:265-279 [Conf]
  5. Simone Tini, Andrea Maggiolo-Schettini
    A Truly Concurrent Semantics for Timed Default Concurrent Constraint Programming. [Citation Graph (0, 0)][DBLP]
    ECOOP Workshops, 1999, pp:256-258 [Conf]
  6. Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini
    Concurrency in Timed Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 2001, pp:240-251 [Conf]
  7. Ruggero Lanotte, Andrea Maggiolo-Schettini, Paolo Milazzo, Angelo Troina
    Modeling Long-Running Transactions with Communicating Hierarchical Timed Automata. [Citation Graph (0, 0)][DBLP]
    FMOODS, 2006, pp:108-122 [Conf]
  8. Andrea Maggiolo-Schettini, Adriano Peron
    Retiming Techniques for Statecharts. [Citation Graph (0, 0)][DBLP]
    FTRTFT, 1996, pp:55-71 [Conf]
  9. Andrea Maggiolo-Schettini, Józef Winkowski
    Processes in Structures. [Citation Graph (0, 0)][DBLP]
    Graph-Grammars and Their Application to Computer Science and Biology, 1978, pp:317-330 [Conf]
  10. Andrea Maggiolo-Schettini, Józef Winkowski
    Programmed Derivations of Relational Structures. [Citation Graph (0, 0)][DBLP]
    Graph-Grammars and Their Application to Computer Science, 1990, pp:582-598 [Conf]
  11. Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini, Angelo Troina, Enrico Tronci
    Automatic Covert Channel Analysis of a Multilevel Secure Component. [Citation Graph (0, 0)][DBLP]
    ICICS, 2004, pp:249-261 [Conf]
  12. Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Angelo Troina
    Bisimulation Congruences in the Calculus of Looping Sequences. [Citation Graph (0, 0)][DBLP]
    ICTAC, 2006, pp:93-107 [Conf]
  13. Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo Troina
    Information Flow Analysis for Probabilistic Timed Automata. [Citation Graph (0, 0)][DBLP]
    Formal Aspects in Security and Trust, 2004, pp:13-26 [Conf]
  14. Andrea Maggiolo-Schettini, Massimo Merro
    Prorities in Statecharts. [Citation Graph (0, 0)][DBLP]
    LOMAPS, 1996, pp:404-429 [Conf]
  15. Hartmut Ehrig, Hans-Jörg Kreowski, Andrea Maggiolo-Schettini, Barry K. Rosen, Józef Winkowski
    Deriving Structures from Structures. [Citation Graph (0, 0)][DBLP]
    MFCS, 1978, pp:177-190 [Conf]
  16. Emanuela Fachini, Andrea Maggiolo-Schettini, Davide Sangiorgi
    Comparisons Among Classes of Y-Tree Systolic Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:254-260 [Conf]
  17. Giorgio Germano, Andrea Maggiolo-Schettini
    Recursivity, Sequence Recursivity, Stack Recursivity and Semantics of Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:52-64 [Conf]
  18. Ruggero Lanotte, Andrea Maggiolo-Schettini
    Timed Automata with Monotonic Activities. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:518-527 [Conf]
  19. Ruggero Lanotte, Andrea Maggiolo-Schettini, Adriano Peron
    Structural Model Checking for Communicating Hierarchical Machines. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:525-536 [Conf]
  20. Andrea Maggiolo-Schettini, Józef Winkowski
    Dynamic Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1996, pp:431-442 [Conf]
  21. Andrea Maggiolo-Schettini, Horst Wedde, Józef Winkowski
    Modelling a Solution for a Control Problem in Distributed Systems by Restrictions. [Citation Graph (0, 0)][DBLP]
    Formale Modelle für Informationssysteme, 1979, pp:199-201 [Conf]
  22. Damas P. Gruska, Andrea Maggiolo-Schettini
    Process Communication Environment. [Citation Graph (0, 0)][DBLP]
    NAPAW, 1992, pp:27-40 [Conf]
  23. Andrea Maggiolo-Schettini, Barry K. Rosen, H. Raymond Strong
    Procedure Linkage Optimization. [Citation Graph (0, 0)][DBLP]
    POPL, 1973, pp:183-193 [Conf]
  24. Andrea Maggiolo-Schettini, Horst Wedde, Józef Winkowski
    Modeling a Solution for a Control Problem in Distributed Systems by Restrictions. [Citation Graph (0, 0)][DBLP]
    Semantics of Concurrent Computation, 1979, pp:226-248 [Conf]
  25. Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo Troina
    Weak Bisimulation for Probabilistic Timed Automata and Applications to Security. [Citation Graph (0, 0)][DBLP]
    SEFM, 2003, pp:34-43 [Conf]
  26. Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo Troina
    Decidability Results for Parametric Probabilistic Transition Systems with an Application to Security. [Citation Graph (0, 0)][DBLP]
    SEFM, 2004, pp:114-121 [Conf]
  27. Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo Troina
    Timed Automata with Data Structures for Distributed Systems Design and Analysis. [Citation Graph (0, 0)][DBLP]
    SEFM, 2005, pp:44-53 [Conf]
  28. Adriano Peron, Andrea Maggiolo-Schettini
    Transitions as Interrupts: A New Semantics for Timed Statecharts. [Citation Graph (0, 0)][DBLP]
    TACS, 1994, pp:806-821 [Conf]
  29. Andrea Maggiolo-Schettini, Adriano Peron
    A Graph Rewriting Framework for Statecharts Semantics. [Citation Graph (0, 0)][DBLP]
    TAGT, 1994, pp:107-121 [Conf]
  30. Emanuela Fachini, Andrea Maggiolo-Schettini, Davide Sangiorgi
    Classes of Systolic Y-Tree Automata and a Comparison with Systolic Trellis Automata. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1992, v:29, n:6/7, pp:623-643 [Journal]
  31. Andrea Maggiolo-Schettini, Józef Winkowski
    A Kernel Language for Programmed Rewriting of (Hyper)graphs. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1996, v:33, n:6, pp:523-546 [Journal]
  32. Giorgio Germano, Andrea Maggiolo-Schettini
    A language for Markov's algorithms composition. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1977, v:3, n:, pp:31-35 [Journal]
  33. Riccardo Focardi, Roberto Gorrieri, Ruggero Lanotte, Andrea Maggiolo-Schettini, Fabio Martinelli, Simone Tini, Enrico Tronci
    Formal Models of Timing Attacks on Web Privacy. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:62, n:, pp:- [Journal]
  34. Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini
    Privacy in Real-Time Systems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:52, n:3, pp:- [Journal]
  35. Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo Troina
    Automatic Analysis of a Non-Repudiation Protocol. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:112, n:, pp:113-129 [Journal]
  36. Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo Troina
    A Classification of Time and/or Probability Dependent Security Properties. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:153, n:2, pp:177-193 [Journal]
  37. Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini, Angelo Troina, Enrico Tronci
    Automatic Analysis of the NRL Pump. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:99, n:, pp:245-266 [Journal]
  38. Andrea Maggiolo-Schettini, Simone Tini
    Projectable Semantics for Statecharts. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1998, v:18, n:, pp:- [Journal]
  39. Simone Tini, Andrea Maggiolo-Schettini
    Two semantics for Timed Default Concurrent Constraint Programming. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1998, v:16, n:1, pp:- [Journal]
  40. Roberto Barbuti, Stefano Cataudella, Andrea Maggiolo-Schettini, Paolo Milazzo, Angelo Troina
    A Probabilistic Model for Molecular Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2005, v:67, n:1-3, pp:13-27 [Journal]
  41. Damas P. Gruska, Andrea Maggiolo-Schettini
    Process Algebras for Network Communication. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:45, n:4, pp:359-378 [Journal]
  42. Andrea Maggiolo-Schettini, G. Michele Pinna, Józef Winkowski
    A compositional semantics for unmarked predicate/transition nets. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1991, v:14, n:1, pp:109-128 [Journal]
  43. Andrea Maggiolo-Schettini, Gionata Matteucci
    Processes in Cause-Effect Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:31, n:3/4, pp:305-335 [Journal]
  44. Andrea Maggiolo-Schettini, Simone Tini
    Applying Techniques of Asynchronous Concurrency to Synchronous Languages. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:40, n:2-3, pp:221-250 [Journal]
  45. Andrea Maggiolo-Schettini, Józef Winkowski
    A Partial Order Representation of Processes of Transforming Graphs. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:31, n:3/4, pp:337-355 [Journal]
  46. Ruggero Lanotte, Andrea Maggiolo-Schettini, Adriano Peron
    Timed Cooperating Automata. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2000, v:43, n:1-4, pp:153-173 [Journal]
  47. Ruggero Lanotte, Andrea Maggiolo-Schettini, Adriano Peron, Simone Tini
    Dynamic Hierarchical Machines. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:54, n:2-3, pp:237-252 [Journal]
  48. Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini, Adriano Peron
    Transformations of Timed Cooperating Automata. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:47, n:3-4, pp:271-282 [Journal]
  49. Simone Tini, Andrea Maggiolo-Schettini
    Compositional Synthesis of Generalized Mealy Machines. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2004, v:60, n:1-4, pp:367-382 [Journal]
  50. Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Angelo Troina
    A Calculus of Looping Sequences for Modelling Microbiological Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:72, n:1-3, pp:21-35 [Journal]
  51. Emanuela Fachini, Jozef Gruska, Andrea Maggiolo-Schettini, Davide Sangiorgi
    Simulation of Systolic Tree Automata on Trellis Automata. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1990, v:1, n:2, pp:87-110 [Journal]
  52. Roberto Gorrieri, Ruggero Lanotte, Andrea Maggiolo-Schettini, Fabio Martinelli, Simone Tini, Enrico Tronci
    Automated analysis of timed security: a case study on web privacy. [Citation Graph (0, 0)][DBLP]
    Int. J. Inf. Sec., 2004, v:2, n:3-4, pp:168-186 [Journal]
  53. Giorgio Germano, Andrea Maggiolo-Schettini
    Sequence-to-Sequence Recursiveness. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1975, v:4, n:1, pp:1-6 [Journal]
  54. Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini
    Epsilon-transitions in Concurrent Timed Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:1, pp:1-7 [Journal]
  55. Andrea Maggiolo-Schettini, Simone Tini
    On disjunction of literals in triggers of statecharts transitions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:6, pp:305-310 [Journal]
  56. E. Facchini, Andrea Maggiolo-Schettini
    A Hierarchy of primitive recursive sequence functions. [Citation Graph (0, 0)][DBLP]
    ITA, 1979, v:13, n:1, pp:- [Journal]
  57. Andrea Masini, Andrea Maggiolo-Schettini
    TTL: A formalism to describe local and global properties of distributed systems. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:115-162 [Journal]
  58. Giorgio Germano, Andrea Maggiolo-Schettini
    Proving a Compiler Correct: A Simple Approach. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1975, v:10, n:3, pp:370-383 [Journal]
  59. Giorgio Germano, Andrea Maggiolo-Schettini
    Computable Stack Functions for Semantics of Stack Programs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1979, v:19, n:2, pp:133-144 [Journal]
  60. Ruggero Lanotte, Andrea Maggiolo-Schettini
    Monotonic hybrid systems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:71, n:1, pp:34-69 [Journal]
  61. Andrea Maggiolo-Schettini, Józef Winkowski
    Processes of Transforming Structures. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1982, v:24, n:3, pp:245-282 [Journal]
  62. Józef Winkowski, Andrea Maggiolo-Schettini
    An Algebra of Processes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1987, v:35, n:2, pp:206-228 [Journal]
  63. Hartmut Ehrig, Hans-Jörg Kreowski, Andrea Maggiolo-Schettini, Barry K. Rosen, Józef Winkowski
    Transformations of Structures: an Algebraic Approach. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1981, v:14, n:, pp:305-334 [Journal]
  64. H. R. Strong Jr., Andrea Maggiolo-Schettini
    Recursion Structure Simplification. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1975, v:4, n:3, pp:307-320 [Journal]
  65. Antonio Cerone, Andrea Maggiolo-Schettini
    Time-Based Expressivity of Time Petri Nets for System Specification. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:216, n:1-2, pp:1-53 [Journal]
  66. Emanuela Fachini, Andrea Maggiolo-Schettini, Giovanni Resta, Davide Sangiorgi
    Nonacceptability Criteria and Closure Properties for the Class of Languages Accepted by Binary Systolic Tree Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:83, n:2, pp:249-260 [Journal]
  67. Giorgio Germano, Andrea Maggiolo-Schettini
    Sequence Recursiveness Without Cylindrification and Limited Register Machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:15, n:, pp:213-221 [Journal]
  68. Andrea Maggiolo-Schettini, Adriano Peron, Simone Tini
    A comparison of Statecharts step semantics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:465-498 [Journal]
  69. Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini
    Concurrency in timed automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:309, n:1-3, pp:503-527 [Journal]
  70. Andrea Maggiolo-Schettini, Józef Winkowski
    Towards an Algebra for Timed Behaviours. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:103, n:2, pp:335-363 [Journal]
  71. Andrea Maggiolo-Schettini, Horst Wedde, Józef Winkowski
    Modeling a Solution for a Control Problem in Distributed Systems by Restrictions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:13, n:, pp:61-83 [Journal]
  72. Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini
    Information flow in hybrid systems. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Embedded Comput. Syst., 2004, v:3, n:4, pp:760-799 [Journal]
  73. Andrea Maggiolo-Schettini, Margherita Napoli, Genoveffa Tortora
    Web Structures: A Tool for Representing and Manipulating Programs. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1988, v:14, n:11, pp:1621-1639 [Journal]
  74. Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo
    Extending the Calculus of Looping Sequences to Model Protein Interaction at the Domain Level. [Citation Graph (0, 0)][DBLP]
    ISBRA, 2007, pp:638-649 [Conf]
  75. Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo Troina
    Parametric probabilistic transition systems for system design and analysis. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 2007, v:19, n:1, pp:93-109 [Journal]

  76. Simulation of Kohn's Molecular Interaction Maps through Translation into Stochastic CLS+. [Citation Graph (, )][DBLP]


  77. The Calculus of Looping Sequences for Modeling Biological Membranes. [Citation Graph (, )][DBLP]


  78. The Calculus of Looping Sequences. [Citation Graph (, )][DBLP]


  79. On the Interpretation of Delays in Delay Stochastic Simulation of Biological Systems [Citation Graph (, )][DBLP]


  80. A Process Calculus for Molecular Interaction Maps [Citation Graph (, )][DBLP]


  81. Modelling the Dynamics of an Aedes albopictus Population [Citation Graph (, )][DBLP]


  82. An Intermediate Language for the Simulation of Biological Systems. [Citation Graph (, )][DBLP]


  83. Timed P Automata. [Citation Graph (, )][DBLP]


  84. Spatial Calculus of Looping Sequences. [Citation Graph (, )][DBLP]


Search in 8.956secs, Finished in 8.959secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002