The following pages link to Andrea Maggiolo-Schettini (Q256972):
Displaying 50 items.
- Identification of components in biochemical pathways: extensive aqpplication to SBML models (Q256973) (← links)
- An algorithm for the identification of components in biochemical pathways (Q276001) (← links)
- Compositional semantics and behavioural equivalences for reaction systems with restriction (Q403001) (← links)
- Foundational aspects of multiscale modeling of biological systems with process algebras (Q418838) (← links)
- Spatial P systems (Q537815) (← links)
- (Q587523) (redirect page) (← links)
- Weak bisimulation for probabilistic timed automata (Q606996) (← links)
- Spatial calculus of looping sequences (Q652132) (← links)
- Universal axioms for bisimulations (Q685411) (← links)
- On categorical graph grammars integrating structural transformations and operations on labels (Q685458) (← links)
- Reachability results for timed automata with unbounded data structures (Q707597) (← links)
- Note on node-rewriting graph grammars (Q796997) (← links)
- Nonterminal separation in graph grammars (Q804300) (← links)
- Closure functions and general iterates as reflectors (Q808275) (← links)
- Parametric probabilistic transition systems for system design and analysis (Q877158) (← links)
- Compositional semantics and behavioral equivalences for P systems (Q924685) (← links)
- Bisimulations in calculi modelling membranes (Q939161) (← links)
- Design and verification of long-running transactions in a timed framework (Q955710) (← links)
- Compositional semantics of spiking neural P systems (Q987958) (← links)
- \(\varepsilon\)-transitions in concurrent timed automata (Q1029035) (← links)
- An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets (Q1059399) (← links)
- Restrictions on NLC graph grammars (Q1059402) (← links)
- An algebra of processes (Q1096381) (← links)
- Extensional equivalences for transition systems (Q1098303) (← links)
- Converting Lamport's regular register to atomic register (Q1114404) (← links)
- Primitive iteration and unary functions (Q1115608) (← links)
- Concurrent systems and inevitability (Q1122355) (← links)
- Computable stack functions for semantics of stack programs (Q1137385) (← links)
- Modeling a solution for a control problem in distributed systems by restrictions (Q1143170) (← links)
- Sequence recursiveness without cylindrification and limited register machines (Q1154263) (← links)
- Processes of transforming structures (Q1166273) (← links)
- Foundations of rule-based design of modular systems (Q1176249) (← links)
- Towards an algebra for timed behaviours (Q1199544) (← links)
- Proving a compiler correct: A simple approach (Q1216945) (← links)
- Sequence-to-sequence recursiveness (Q1219273) (← links)
- Time-based expressivity of time Petri nets for system specification (Q1285652) (← links)
- (Q1323374) (redirect page) (← links)
- Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata (Q1323376) (← links)
- Regular relations and bicartesian squares (Q1329746) (← links)
- Banach's fixed-point theorem as a base for data-type equations (Q1330915) (← links)
- Demonic semantics: using monotypes and residuals (Q1774651) (← links)
- A decision procedure for semantical equivalence of thin FM specifications (Q1818643) (← links)
- On disjunction of literals in triggers of statecharts transitions. (Q1853160) (← links)
- A comparison of Statecharts step semantics (Q1853596) (← links)
- Categories with sums and right distributive tensor product (Q1861509) (← links)
- Concurrency in timed automata (Q1884910) (← links)
- A kernel language for programmed rewriting of (hyper)graphs (Q1901702) (← links)
- An intermediate language for the stochastic simulation of biological systems (Q2271445) (← links)
- Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata (Q2277854) (← links)
- Component identification in biochemical pathways (Q2348029) (← links)
