Andrea Maggiolo-Schettini

From MaRDI portal
Revision as of 23:39, 9 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Andrea Maggiolo-Schettini to Andrea Maggiolo-Schettini: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:256972

Available identifiers

zbMath Open maggiolo-schettini.andreaMaRDI QIDQ256972

List of research outcomes





PublicationDate of PublicationType
Equivalences of Statecharts2023-06-28Paper
Semantics of full statecharts based on graph rewriting2022-08-16Paper
Modeling Long–Running Transactions with Communicating Hierarchical Timed Automata2021-05-25Paper
https://portal.mardi4nfdi.de/entity/Q46211462019-02-08Paper
Modular Verification of Qualitative Pathway Models with Fairness2019-02-08Paper
A graph rewriting framework for Statecharts semantics2019-01-10Paper
A METHODOLOGY FOR THE STOCHASTIC MODELING AND SIMULATION OF SYMPATRIC SPECIATION BY SEXUAL SELECTION2016-08-09Paper
An algorithm for the identification of components in biochemical pathways2016-04-26Paper
Identification of components in biochemical pathways: extensive aqpplication to SBML models2016-03-14Paper
Systolic Automata and P Systems2015-09-08Paper
Modelling Biochemical Pathways with the Calculus of Looping Sequences2015-07-16Paper
Component identification in biochemical pathways2015-06-10Paper
Timed P Automata2015-03-19Paper
Compositional semantics and behavioural equivalences for reaction systems with restriction2014-08-29Paper
Spatial Calculus of Looping Sequences2014-03-21Paper
Modular Verification of Interactive Systems with an Application to Biology2014-03-21Paper
Simulation of spatial P system models2014-03-19Paper
An Intermediate Language for the Simulation of Biological Systems2014-01-17Paper
https://portal.mardi4nfdi.de/entity/Q28498492013-09-20Paper
A Compositional Semantics of Reaction Systems with Restriction2013-08-05Paper
Formal Models of Timing Attacks on Web Privacy2013-07-24Paper
On Conditions for Modular Verification in Systems of Synchronising Components2013-01-14Paper
Foundational aspects of multiscale modeling of biological systems with process algebras2012-05-30Paper
Spatial calculus of looping sequences2011-12-19Paper
A Notion of Biological Diagnosability Inspired by the Notion of Opacity in Systems Security2011-06-14Paper
https://portal.mardi4nfdi.de/entity/Q30052452011-06-07Paper
Delay Stochastic Simulation of Biological Systems: A Purely Delayed Approach2011-05-27Paper
Spatial P systems2011-05-23Paper
A Formalism for the Description of Protein Interaction Dedicated to Jerzy Tiuryn on the Occasion of his 60th Birthday2011-05-18Paper
AN OVERVIEW ON OPERATIONAL SEMANTICS IN MEMBRANE COMPUTING2011-02-23Paper
Membrane Systems Working in Generating and Accepting Modes: Expressiveness and Encodings2011-01-21Paper
Weak bisimulation for probabilistic timed automata2010-11-19Paper
Reachability results for timed automata with unbounded data structures2010-10-08Paper
Compositional semantics of spiking neural P systems2010-08-24Paper
Simulation of Kohn’s Molecular Interaction Maps through Translation into Stochastic CLS+2010-02-02Paper
Timed P Automata2009-09-22Paper
https://portal.mardi4nfdi.de/entity/Q51929212009-08-10Paper
An intermediate language for the stochastic simulation of biological systems2009-08-07Paper
Stochastic Calculus of Looping Sequences for the Modelling and Simulation of Cellular Pathways2009-07-28Paper
\(\varepsilon\)-transitions in concurrent timed automata2009-07-09Paper
https://portal.mardi4nfdi.de/entity/Q36018532009-02-12Paper
https://portal.mardi4nfdi.de/entity/Q55063672009-01-28Paper
Design and verification of long-running transactions in a timed framework2008-11-20Paper
Bisimulation Congruences in the Calculus of Looping Sequences2008-09-11Paper
Bisimulations in calculi modelling membranes2008-08-21Paper
Compositional semantics and behavioral equivalences for P systems2008-05-19Paper
The Calculus of Looping Sequences for Modeling Biological Membranes2008-03-28Paper
Parametric probabilistic transition systems for system design and analysis2007-04-19Paper
https://portal.mardi4nfdi.de/entity/Q54860472006-09-06Paper
https://portal.mardi4nfdi.de/entity/Q54729322006-06-19Paper
Mathematical Foundations of Computer Science 20042005-08-22Paper
Information and Communications Security2005-08-19Paper
Monotonic hybrid systems2005-08-05Paper
Concurrency in timed automata2004-10-27Paper
https://portal.mardi4nfdi.de/entity/Q48187522004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q44619592004-05-18Paper
https://portal.mardi4nfdi.de/entity/Q27758642003-02-02Paper
On disjunction of literals in triggers of statecharts transitions.2003-01-21Paper
A comparison of Statecharts step semantics2003-01-21Paper
https://portal.mardi4nfdi.de/entity/Q47827132002-12-02Paper
https://portal.mardi4nfdi.de/entity/Q45363872002-06-25Paper
https://portal.mardi4nfdi.de/entity/Q27671772002-01-28Paper
https://portal.mardi4nfdi.de/entity/Q27296672001-07-23Paper
https://portal.mardi4nfdi.de/entity/Q45078192000-10-10Paper
https://portal.mardi4nfdi.de/entity/Q44907622000-07-20Paper
https://portal.mardi4nfdi.de/entity/Q49480142000-04-26Paper
Time-based expressivity of time Petri nets for system specification1999-04-28Paper
https://portal.mardi4nfdi.de/entity/Q43817151998-07-27Paper
https://portal.mardi4nfdi.de/entity/Q43817161998-04-01Paper
A kernel language for programmed rewriting of (hyper)graphs1995-11-19Paper
Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata1994-05-10Paper
https://portal.mardi4nfdi.de/entity/Q40373291993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40281321993-03-28Paper
Towards an algebra for timed behaviours1993-01-16Paper
TTL : a formalism to describe local and global properties of distributed systems1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q57488951991-01-01Paper
Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata1991-01-01Paper
SIMULATION OF SYSTOLIC TREE AUTOMATA ON TRELLIS AUTOMATA1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33618991990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34748961990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42064091989-01-01Paper
Web structures: a tool for representing and manipulating programs1988-01-01Paper
An algebra of processes1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36731621983-01-01Paper
Processes of transforming structures1982-01-01Paper
Comparing Hierarchies of Primitive Recursive Sequence Functions1982-01-01Paper
Modeling a solution for a control problem in distributed systems by restrictions1981-01-01Paper
Sequence recursiveness without cylindrification and limited register machines1981-01-01Paper
Transformations of structures: An algebraic approach1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39520991980-01-01Paper
Computable stack functions for semantics of stack programs1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38770261979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38869071979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41863061979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41873041979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41584991978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41626281978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41078871976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41138101976-01-01Paper
Proving a compiler correct: A simple approach1975-01-01Paper
Sequence-to-sequence recursiveness1975-01-01Paper
Recursion Structure Simplification1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40680711973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40871541973-01-01Paper
A flow diagram composition of Markov's normal algorithms without concluding formulas1973-01-01Paper
Equivalence of partial recursivity and computability by algorithms without concluding formulas1972-01-01Paper

Research outcomes over time

This page was built for person: Andrea Maggiolo-Schettini