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