Piazza Carla
Latest
-
Delimited persistent stochastic non-interference
-
Entangλe: A Translation Framework from Quipper Programs to Quantum Markov Chains
-
Information Flow Security for Stochastic Processes
-
Lumping-based equivalences in Markovian automata: Algorithms and applications to product-form analyses
-
Persistent stochastic non-interference
-
Efficient Computation of Renaming Functions for ρ-reversibility Discrete and Continuous Time Markov Chains
-
Games, Automata, Logics, and Formal Verification (GandALF2014) - Preface
-
Reachability computation for polynomial dynamical systems
-
Is Hyper-extensionality Preservable under Deletions of Graph Elements?
-
Parallelotope bundles for polynomial reachability
-
Towards quantum programs verification: from quipper circuits to QPMC
-
Hybrid Systems Biology: Second International Workshop, HSB 2013 Taormina, Italy, September 2, 2013 and Third International Workshop, HSB 2014 Vienna, Austria, July 23–24, 2014 Revised Selected Papers
-
Parameter Synthesis Through Temporal Logic Specifications
-
Rank and simulation: the well-founded case
-
Unwinding biological systems
-
Proceedings Fifth International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2014, Verona, Italy, September 10-12, 2014
-
ϵ-Semantics computations on biological systems
-
A graph-theoretic approach to map conceptual designs to XML schemas
-
Approximated Symbolic Computations over Hybrid Automata
-
Hybrid Automata and epsilon-Analysis on a Neural Oscillator
-
Model Checking on Hybrid Automata: Theory and Application to Biological Systems
-
Rank-Based Simulation on Acyclic Graphs
-
From entity relationship to XML Schema: A graph-theoretic approach (extended abstract)
-
Morphos Configuration Engine: the Core of a Commercial Configuration System in CLP(FD)
-
Discrete Semantics for Hybrid Automata
-
External Control in Process Algebra for Systems Biology
-
From Entity Relationship to XML Schema: A Graph-Theoretic Approach
-
Hybrid Automata in Systems Biology: How far can we go?
-
A uniform approach to constraint-solving for lists, multisets, compact lists, and sets
-
Decidable Compositions of O-Minimal Automata
-
Inclusion dynamics hybrid automata
-
PicNIc - Pi-calculus Non-Interference checker
-
Systems Biology: Models and Logics
-
Compositional information flow security for concurrent programs
-
Information flow in secure contexts
-
An Efficient Algorithm for Computing Bisimulation Equivalence
-
Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice
-
A sense of life: computational and experimental investigations with models of biochemical and evolutionary processes
-
Computing strongly connected components in a linear number of symbolic steps
-
The Subgraph Bisimulation Problem
-
Rank-Based Symbolic Bisimulation (and Model Checking)
-
Ackermann Encoding, Bisimulations, and OBDD's
-
Sets and Constraint Logic Programming
-
Towards tableau-based decision procedures for non-well-founded fragments of set theory