Andrea Maggiolo-Schettini

According to our database1, Andrea Maggiolo-Schettini authored at least 125 papers between 1973 and 2015.

Collaborative distances :

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2015
Component identification in biochemical pathways.
Theor. Comput. Sci., 2015

2014
Compositional semantics and behavioural equivalences for reaction systems with restriction.
Theor. Comput. Sci., 2014

Simulation of Spatial P system models.
Theor. Comput. Sci., 2014

Identification of components in biochemical pathways: extensive application to SBML models.
Natural Computing, 2014

Systolic Automata and P Systems.
Proceedings of the Computing with New Resources, 2014

2013
An Algorithm for the Identification of Components in Biochemical Pathways.
Electr. Notes Theor. Comput. Sci., 2013

Modular Verification of Qualitative Pathway Models with Fairness.
Sci. Ann. Comp. Sci., 2013

Application of a Semi-automatic Algorithm for Identification of Molecular Components in SBML Models.
Proceedings of the Proceedings Wivace 2013, 2013

A Computational Formal Model of the Invasiveness of Eastern Species in European Water Frog Populations.
Proceedings of the Software Engineering and Formal Methods, 2013

A Compositional Semantics of Reaction Systems with Restriction.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012
Foundational aspects of multiscale modeling of biological systems with process algebras.
Theor. Comput. Sci., 2012

On Conditions for Modular Verification in Systems of Synchronising Components.
Fundam. Inform., 2012

Towards modular verification of pathways: fairness and assumptions
Proceedings of the Proceedings 6th Workshop on Membrane Computing and Biologically Inspired Process Calculi, 2012

Modelling Population Dynamics Using Grid Systems.
Proceedings of the Information Technology and Open Source: Applications for Education, Innovation, and Sustainability, 2012

2011
Delay Stochastic Simulation of Biological Systems: A Purely Delayed Approach.
Trans. Computational Systems Biology, 2011

Spatial Calculus of Looping Sequences.
Theor. Comput. Sci., 2011

Spatial P systems.
Natural Computing, 2011

An Overview on Operational Semantics in Membrane Computing.
Int. J. Found. Comput. Sci., 2011

Modular Verification of Interactive Systems with an Application to Biology.
Sci. Ann. Comp. Sci., 2011

A Testing Framework for P Systems
CoRR, 2011

2010
Time and Probability-Based Information Flow Analysis.
IEEE Trans. Software Eng., 2010

Weak bisimulation for Probabilistic Timed Automata.
Theor. Comput. Sci., 2010

Compositional semantics of spiking neural P systems.
J. Log. Algebr. Program., 2010

A Formalism for the Description of Protein Interaction Dedicated to Jerzy Tiuryn on the Occasion of his 60th Birthday.
Fundam. Inform., 2010

A Notion of Biological Diagnosability Inspired by the Notion of Opacity in Systems Security.
Fundam. Inform., 2010

Modular Verification of Interactive Systems with an Application to Biology.
Electr. Notes Theor. Comput. Sci., 2010

Aspects of multiscale modelling in a process algebra for biological systems
Proceedings of the Proceedings Fourth Workshop on Membrane Computing and Biologically Inspired Process Calculi, 2010

Modelling the Dynamics of an Aedes albopictus Population
Proceedings of the Proceedings First Workshop on Applications of Membrane computing, 2010

Reachability results for timed automata with unbounded data structures.
Acta Inf., 2010

Dynamic Sync-Programs for Modular Verification of Biological Systems.
Proceedings of the Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23, 2010

Membrane Systems Working in Generating and Accepting Modes: Expressiveness and Encodings.
Proceedings of the Membrane Computing, 2010

2009
An intermediate language for the stochastic simulation of biological systems.
Theor. Comput. Sci., 2009

Timed P Automata.
Fundam. Inform., 2009

P Systems with Transport and Diffusion Membrane Channels.
Fundam. Inform., 2009

Timed P Automata.
Electr. Notes Theor. Comput. Sci., 2009

Spatial Calculus of Looping Sequences.
Electr. Notes Theor. Comput. Sci., 2009

A Process Calculus for Molecular Interaction Maps
Proceedings of the Proceedings Third Workshop on Membrane Computing and Biologically Inspired Process Calculi, 2009

On the Interpretation of Delays in Delay Stochastic Simulation of Biological Systems
Proceedings of the Proceedings Second International Workshop on Computational Models for Cell Processes, 2009

Simulation of Kohn's Molecular Interaction Maps through Translation into Stochastic CLS+.
Proceedings of the Perspectives of Systems Informatics, 2009

2008
Stochastic Calculus of Looping Sequences for the Modelling and Simulation of Cellular Pathways.
Trans. Computational Systems Biology, 2008

Compositional semantics and behavioral equivalences for P Systems.
Theor. Comput. Sci., 2008

Design and verification of long-running transactions in a timed framework.
Sci. Comput. Program., 2008

Security in a Model for Long-running Transactions.
Fundam. Inform., 2008

A P Systems Flat Form Preserving Step-by-step Behaviour.
Fundam. Inform., 2008

Bisimulations in calculi modelling membranes.
Formal Asp. Comput., 2008

An Intermediate Language for the Simulation of Biological Systems.
Electr. Notes Theor. Comput. Sci., 2008

The Calculus of Looping Sequences.
Proceedings of the Formal Methods for Computational Systems Biology, 2008

2007
Parametric probabilistic transition systems for system design and analysis.
Formal Asp. Comput., 2007

The Calculus of Looping Sequences for Modeling Biological Membranes.
Proceedings of the Membrane Computing, 8th International Workshop, 2007

Extending the Calculus of Looping Sequences to Model Protein Interaction at the Domain Level.
Proceedings of the Bioinformatics Research and Applications, Third International Symposium, 2007

2006
A Calculus of Looping Sequences for Modelling Microbiological Systems.
Fundam. Inform., 2006

A Classification of Time and/or Probability Dependent Security Properties.
Electr. Notes Theor. Comput. Sci., 2006

Bisimulation Congruences in the Calculus of Looping Sequences.
Proceedings of the Theoretical Aspects of Computing, 2006

Modeling Long-Running Transactions with Communicating Hierarchical Timed Automata.
Proceedings of the Formal Methods for Open Object-Based Distributed Systems, 2006

2005
Monotonic hybrid systems.
J. Comput. Syst. Sci., 2005

A Probabilistic Model for Molecular Systems.
Fundam. Inform., 2005

Automatic Analysis of a Non-Repudiation Protocol.
Electr. Notes Theor. Comput. Sci., 2005

Timed Automata with Data Structures for Distributed Systems Design and Analysis.
Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (SEFM 2005), 2005

2004
Information flow in hybrid systems.
ACM Trans. Embedded Comput. Syst., 2004

Epsilon-transitions in Concurrent Timed Automata.
Inf. Process. Lett., 2004

Automated analysis of timed security: a case study on web privacy.
Int. J. Inf. Sec., 2004

Compositional Synthesis of Generalized Mealy Machines.
Fundam. Inform., 2004

Automatic Analysis of the NRL Pump.
Electr. Notes Theor. Comput. Sci., 2004

Decidability Results for Parametric Probabilistic Transition Systems with an Application to Security.
Proceedings of the 2nd International Conference on Software Engineering and Formal Methods (SEFM 2004), 2004

Structural Model Checking for Communicating Hierarchical Machines.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Information Flow Analysis for Probabilistic Timed Automata.
Proceedings of the Formal Aspects in Security and Trust: Second IFIP TC1 WG1.7 Workshop on Formal Aspects in Security and Trust (FAST), 2004

Automatic Covert Channel Analysis of a Multilevel Secure Component.
Proceedings of the Information and Communications Security, 6th International Conference, 2004

2003
A comparison of Statecharts step semantics.
Theor. Comput. Sci., 2003

Concurrency in timed automata.
Theor. Comput. Sci., 2003

Dynamic Hierarchical Machines.
Fundam. Inform., 2003

Weak Bisimulation for Probabilistic Timed Automata and Applications to Security.
Proceedings of the 1st International Conference on Software Engineering and Formal Methods (SEFM 2003), 2003

2002
On disjunction of literals in triggers of statecharts transitions.
Inf. Process. Lett., 2002

2001
Transformations of Timed Cooperating Automata.
Fundam. Inform., 2001

Process Algebras for Network Communication.
Fundam. Inform., 2001

Privacy in Real-Time Systems.
Electr. Notes Theor. Comput. Sci., 2001

Formal Models of Timing Attacks on Web Privacy.
Electr. Notes Theor. Comput. Sci., 2001

Concurrency in Timed Automata.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

2000
Timed Cooperating Automata.
Fundam. Inform., 2000

Timed Automata with Monotonic Activities.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

A Causal Semantics for Timed Default Concurrent Constraint Programming.
Proceedings of the Algebraic Methodology and Software Technology. 8th International Conference, 2000

1999
Time-Based Expressivity of Time Petri Nets for System Specification.
Theor. Comput. Sci., 1999

Applying Techniques of Asynchronous Concurrency to Synchronous Languages.
Fundam. Inform., 1999

A Truly Concurrent Semantics for Timed Default Concurrent Constraint Programming.
Proceedings of the Object-Oriented Technology, ECOOP'99 Workshop Reader, 1999

1998
Two semantics for Timed Default Concurrent Constraint Programming.
Electr. Notes Theor. Comput. Sci., 1998

Projectable Semantics for Statecharts.
Electr. Notes Theor. Comput. Sci., 1998

1997
A Partial Order Representation of Processes of Transforming Graphs.
Fundam. Inform., 1997

Processes in Cause-Effect Systems.
Fundam. Inform., 1997

1996
A Kernel Language for Programmed Rewriting of (Hyper)graphs.
Acta Inf., 1996

Dynamic Graphs.
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

Prorities in Statecharts.
Proceedings of the Analysis and Verification of Multiple-Agent Languages, 1996

Retiming Techniques for Statecharts.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1996

Equivalences of Statecharts.
Proceedings of the CONCUR '96, 1996

1994
A Graph Rewriting Framework for Statecharts Semantics.
Proceedings of the Graph Gramars and Their Application to Computer Science, 1994

Transitions as Interrupts: A New Semantics for Timed Statecharts.
Proceedings of the Theoretical Aspects of Computer Software, 1994

1993
Semantics of Full Statecharts Based on Graph Rewriting.
Proceedings of the Graph Transformations in Computer Science, International Workshop, 1993

1992
Towards an Algebra for Timed Behaviours.
Theor. Comput. Sci., 1992

TTL: A formalism to describe local and global properties of distributed systems.
ITA, 1992

Classes of Systolic Y-Tree Automata and a Comparison with Systolic Trellis Automata.
Acta Inf., 1992

Process Communication Environment.
Proceedings of the NAPAW 92, 1992

A Programming Language for Deriving Hypergraphs.
Proceedings of the CAAP '92, 1992

1991
Nonacceptability Criteria and Closure Properties for the Class of Languages Accepted by Binary Systolic Tree Automata.
Theor. Comput. Sci., 1991

A compositional semantics for unmarked predicate/transition nets.
Fundam. Inform., 1991

1990
Simulation of Systolic Tree Automata on Trellis Automata.
Int. J. Found. Comput. Sci., 1990

Comparisons Among Classes of Y-Tree Systolic Automata.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Programmed Derivations of Relational Structures.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1990

1988
Web Structures: A Tool for Representing and Manipulating Programs.
IEEE Trans. Software Eng., 1988

Fondamenti di informatica.
ETS Editrice, 1988

1987
An Algebra of Processes.
J. Comput. Syst. Sci., 1987

1982
Comparing Hierarchies of Primitive Recursive Sequence Functions.
Math. Log. Q., 1982

Processes of Transforming Structures.
J. Comput. Syst. Sci., 1982

1981
Modeling a Solution for a Control Problem in Distributed Systems by Restrictions.
Theor. Comput. Sci., 1981

Sequence Recursiveness Without Cylindrification and Limited Register Machines.
Theor. Comput. Sci., 1981

Transformations of Structures: an Algebraic Approach.
Mathematical Systems Theory, 1981

1979
Computable Stack Functions for Semantics of Stack Programs.
J. Comput. Syst. Sci., 1979

A Hierarchy of primitive recursive sequence functions.
ITA, 1979

Modeling a Solution for a Control Problem in Distributed Systems by Restrictions.
Proceedings of the Semantics of Concurrent Computation, 1979

Modelling a Solution for a Control Problem in Distributed Systems by Restrictions.
Formale Modelle für Informationssysteme, 1979

1978
Deriving Structures from Structures.
Proceedings of the Mathematical Foundations of Computer Science 1978, 1978

Processes in Structures.
Proceedings of the Graph-Grammars and Their Application to Computer Science and Biology, 1978

1976
A language for Markov's algorithms composition.
Acta Cybern., 1976

Recursivity, Sequence Recursivity, Stack Recursivity and Semantics of Programs.
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

1975
Recursion Structure Simplification.
SIAM J. Comput., 1975

Proving a Compiler Correct: A Simple Approach.
J. Comput. Syst. Sci., 1975

Sequence-to-Sequence Recursiveness.
Inf. Process. Lett., 1975

1973
Procedure Linkage Optimization.
Proceedings of the Conference Record of the ACM Symposium on Principles of Programming Languages, 1973


  Loading...