Piazza C

Latest

A process algebra for (delimited) persistent stochastic non-interference
Proportional Lumpability
High-throughput trascriptome profiling of two peach chimeric genotypes
Hybrid automata, reachability, and Systems Biology
Action Refinement in Process Algebra and Security Issues
Discreteness, hybrid automata, and biology
Model Checking, Hybrid Automata, and Systems Biology
Symbolic Graphs: Linear Solutions to Connectivity Related Problems
Synchronized Product of Semi-Algebraic O-Minimal Hybrid Automata
Translating Time-Course Gene Expression Profiles into Semi-algebraic Hybrid Automata Via Dimensionality Reduction
Combining static and dynamic analysis for the verification of Information Flow Security in Concurrent Programs
Tolque: A Tool for Algorithmic Algebraic Model Checking
Algebraic Model Checking II: Decidability of Semi-Algebraic Model Checking and its Applications to Systems Biology
Algorithmic Algebraic Model Checking I: Challenges from Systems Biology⋆
Independent Dynamics Hybrid Automata in System Biology
Semi-Algebraic Constant Reset Hybrid Automata - SACoRe
Stability of Hybrid Systems and Related Questions from Systems Biology
Unwinding Conditions for Security in Imperative Languages
Ackermann Encodings, Bisimulations, and OBDDs
Behind Banana: Design and Implemantation of a Tool for Nesting Analysis of Mobile Ambients
Checking Integrity via CoPS and Banana: the E-Commerce Case Study
CoPS - Checker of Persistent Security
Disunification in ACI1 Theories
Modelling Downgrading in Information Flow Security
Nesting Analysis of Mobile Ambients
Unwinding in Information Flow Security
Verifying Persistent Security Properties
A Proof System for Information Flow Security
BANANA - A Tool for Boundary Ambients Nesting ANAlysis
Bisimulation and Unwinding for Verifying Possibilistic Security Properties
Complexity of Nesting Analysis in Mobile Ambients
From Bisimulation to Simulation: Coarsest Partition Problems
Information Flow Security and Recursive Systems
Modeling Cellular Behavior with Hybrid Automata: Bisimulation and Collapsing
Refinement Operators and Information Flow Security
Secure Contexts for Confidential Data
Simulating Polyadic Modal Logics by Monadic Ones
Computing in Non Standard Set Theories
Proofs Methods for Bisimulation Based Information Flow Security
Simulation as Coarsest Partition Problem
Simulation Reduction as Constraint
Transforming Processes to Check and Ensure Information Flow Security
A Fast Bisimulation Algorithm
Multiset Constraints and P Systems
Multiset rewriting by multiset constraint solving
Comparing Expressiveness of Set Constructor Symbols
ACI1 Constraints
On the Representation and Management of Finite Sets in CLP-languages