Name
Affiliation
Papers
MARINO MICULAN
Department of Mathematics and Computer Science, University of Udine, Italy
72
Collaborators
Citations 
PageRank 
51
502
43.24
Referers 
Referees 
References 
429
604
825
Search Limit
100604
Title
Citations
PageRank
Year
A Calculus For Attribute-Based Memory Updates00.342021
Towards a formal model for composable container systems00.342020
Computing Embeddings of Directed Bigraphs.00.342020
Software Transactional Memory with Interactions00.342020
Constructive logical characterizations of bisimilarity for reactive probabilistic systems.00.342019
An Abstract Distributed Middleware for Transactions over Heterogeneous Stores.00.342019
Towards User Recognition by Shallow Web Traffic Inspection.00.342019
Deciding Hedged Bisimilarity.00.342018
Deciding Weak Weighted Bisimulation.00.342017
Loose Graph Simulations.00.342017
Reductions for Transition Systems at Work: Deriving a Logical Characterization of Quantitative Bisimulation.00.342017
Disjunctive Probabilistic Modal Logic is Enough for Bisimilarity on Reactive Probabilistic Systems.10.412016
A Specification of Open Transactional Memory for Haskell.00.342016
On the Bisimulation Hierarchy of State-to-Function Transition Systems.00.342016
Open Transactions On Shared Memory10.392015
Structural operational semantics for continuous state stochastic transition systems.40.422015
Distributed execution of bigraphical reactive systems.30.442015
Structural operational semantics for non-deterministic processes with quantitative aspects.50.412014
Gsos For Non-Deterministic Processes With Quantitative Aspects90.482014
A CSP implementation of the bigraph embedding problem.20.412014
A Model of Countable Nondeterminism in Guarded Type Theory.90.482014
Multi-Agent Systems Design And Prototyping With Bigraphical Reactive Systems120.612014
Behavioural equivalences for coalgebras with unobservable moves.60.472014
Finding a Forest in a Tree - The Matching Problem for Wide Reactive Systems.00.342014
Weak bisimulations for labelled transition systems weighted over semirings.80.462013
Implementing The Stochastics Brane Calculus In A Generic Stochastic Abstract Machine00.342012
Synthesis of Distributed Mobile Programs Using Monadic Types in Coq.10.362012
Structural Operational Semantics for Continuous State Probabilistic Processes.80.462012
Measurable stochastics for Brane Calculus70.512012
Unobservable Intrusion Detection based on Call Traces in Paravirtualized Systems.10.382011
Graph Algebras for Bigraphs40.412010
Bigraphical Models For Protein And Membrane Interactions60.582009
DBtk: a toolkit for directed bigraphs90.692009
A Framework For Protein And Membrane Interactions30.422009
A Categorical Model of the Fusion Calculus130.532008
Deriving Barbed Bisimulations for Bigraphical Reactive Systems20.372008
Undecidability of Model Checking in Brane Logic00.342008
An Algebra for Directed Bigraphs60.642008
Controlling resource access in Directed Bigraphs10.372008
Implementing Spi Calculus Using Nominal Techniques40.452008
Types for Proofs and Programs, International Conference, TYPES 2007, Cividale des Friuli, Italy, May 2-5, 2007, Revised Selected Papers110.962008
Directed Bigraphs100.922007
Reactive systems over directed bigraphs160.952007
Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts70.482007
About permutation algebras, (pre)sheaves and named sets371.532006
Modal logics for brane calculus100.552006
Consistency of the theory of contexts271.272006
A unifying model of variables and names170.672005
Translating specifications from nominal logic to CIC with the theory of contexts90.512005
Modeling Fresh Names in the ?-calculus Using Abstractions00.342004
  • 1
  • 2