CompBio & Bioinf @ UniUd
CompBio & Bioinf @ UniUd
Home
Members
Events
Projects
Software
Publications
Contact
Light
Dark
Automatic
Miculan Marino
Latest
Towards user recognition by shallow web traffic inspection
Constructive logical characterizations of bisimilarity for reactive probabilistic systems
Deciding hedged bisimilarity
Guest editors' foreword
Loose Graph Simulations
Deciding weak weighted bisimulation
Preface
Disjunctive Probabilistic Modal Logic is Enough for Bisimilarity on Reactive Probabilistic Systems
On the bisimulation hierarchy of state-to-function transition systems
Special Issue on Methodologies, Technologies and Tools Enabling e-Government
Behavioural equivalences for coalgebras with unobservable moves
Distributed execution of bigraphical reactive systems
Open transactions on shared memory
Structural operational semantics for continuous state stochastic transition systems
A CSP implementation of the bigraph embedding problem
Finding a Forest in a Tree - The matching problem for wide reactive systems
GSOS for non-deterministic processes with quantitative aspects
Multi-agent Systems Design and Prototyping with Bigraphical Reactive Systems
Structural operational semantics for non-deterministic processes with quantitative aspects
Towards distributed bigraphical reactive systems
Weak bisimulations for labelled transition systems weighted over semirings
Implementing the Stochastics Brane Calculus in a Generic Stochastic Abstract Machine
Structural operational semantics for continuous state probabilistic processes
Formal analysis of Facebook Connect Single Sign-On authentication protocol
Unobservable intrusion detection based on call traces in paravirtualized systems
Graph Algebras for Bigraphs
Measurable Stochastics for Brane Calculus
Proceedings 5th International Workshop on Logical Frameworks and Meta-languages: Theory and Practice
A framework for protein and membrane interactions
Bigraphical models for protein and membrane interactions
DBtk: A Toolkit for Directed Bigraphs
Deriving Barbed Bisimulations for Bigraphical Reactive Systems
A categorical model of the Fusion calculus
An Algebra for Directed Bigraphs
Controlling resource access in Directed Bigraphs
Implementing Spi Calculus using Nominal techniques
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface
PicNIc - Pi-calculus Non-Interference checker
Types for Proofs and Programs International Conference, TYPES 2007, Revised Selected Papers
Undecidability of Model Checking in Brane Logic
Directed Bigraphs
Reactive Systems over Directed Bigraphs
About permutation algebras, (pre)sheaves and named sets
Modal logics for Brane Calculus
A unifying model of variables and names
Translating Specifications from Nominal Logic to CIC with the Theory of Contexts
Some characterization results for permutation algebras
Unifying Recursive and Co-recursive Definitions in Sheaf Categories
A Framework for Typed HOAS and Semantics
A Unifying Approach to Recursive and Co-recursive Definitions
Imperative Object-based Calculi in (Co)Inductive Type Theories
Reasoning on an Imperative Object-based Calculus in Higher Order Abstract Syntax
Special Issue of Theoretical Computer Science on FOSSACS 2001
Theoretical Computer Science: Preface
Frecuencis lessicâls dal furlan scrit
Developing (Meta)Theory of lambda-calculus in the Theory of Contexts
On the formalization of the modal mu-calculus in the calculus of inductive constructions
pi-calculus in (Co)Inductive Type Theories
The Theory of Contexts for First Order and Higher Order Abstract Syntax
Formalizing a lazy substitution proof system for μ-calculus in the Calculus of Inductive Constructions
Encoding Modal Logics in Logical Frameworks
Encoding logical theories of programs
A natural deduction approach to dynamic logic
Modal μ-types for processes
The expressive power of structural operational semantics with explicit assumptions
Cite
×