BALDAN, PAOLO
 Distribuzione geografica
Continente #
NA - Nord America 7.667
EU - Europa 674
AS - Asia 315
Continente sconosciuto - Info sul continente non disponibili 4
SA - Sud America 3
OC - Oceania 1
Totale 8.664
Nazione #
US - Stati Uniti d'America 7.664
CN - Cina 156
UA - Ucraina 156
FI - Finlandia 150
VN - Vietnam 146
DE - Germania 123
IT - Italia 95
GB - Regno Unito 72
SE - Svezia 58
IN - India 8
IE - Irlanda 6
EE - Estonia 4
EU - Europa 4
PH - Filippine 4
CA - Canada 3
FR - Francia 3
NL - Olanda 3
BE - Belgio 2
BR - Brasile 2
NO - Norvegia 2
AU - Australia 1
SG - Singapore 1
VE - Venezuela 1
Totale 8.664
Città #
Fairfield 1.194
Woodbridge 1.082
Houston 840
Jacksonville 672
Ann Arbor 636
Ashburn 520
Seattle 467
Cambridge 419
Wilmington 415
Chandler 268
Princeton 173
Dong Ket 146
San Diego 123
Medford 100
Roxbury 94
Nanjing 57
Boardman 55
Helsinki 48
Des Moines 46
Padova 41
Nanchang 21
Norwalk 15
London 14
Shenyang 14
Hebei 12
Tianjin 12
Indiana 11
Beijing 10
Camponogara 8
Los Angeles 8
Orange 8
Falls Church 7
Guangzhou 7
New York 7
Dublin 6
Jiaxing 6
Kharkiv 6
Selargius 6
Acton 5
Auburn Hills 5
Changsha 5
Jinan 5
Kilburn 5
Yellow Springs 5
Chiswick 4
Pradamano 4
Ningbo 3
Noale 3
Olongapo City 3
Phoenix 3
Pune 3
San Francisco 3
Tappahannock 3
Ahmedabad 2
Atlanta 2
Bologna 2
Croydon 2
Hounslow 2
Keila 2
Lancaster 2
Las Vegas 2
Leuven 2
Lünen 2
Mumbai 2
New Bedfont 2
Ogden 2
Rockville 2
Rome 2
Tartu 2
Trebaseleghe 2
Augusta 1
Bergamo 1
Brendola 1
Canberra 1
Chicago 1
Dansville 1
Frankfurt am Main 1
Geislingen an der Steige 1
Groningen 1
Guanare 1
Hefei 1
Hemet 1
Lanzhou 1
Leawood 1
Milan 1
Monmouth Junction 1
Nove 1
Nuremberg 1
Pisa 1
Redwood City 1
Saint Marys 1
San Mateo 1
Singapore 1
Southwark 1
Trieste 1
Vazia 1
Venezia 1
Venice 1
Vigonza 1
Walnut 1
Totale 7.697
Nome #
Fixpoint games on continuous lattices 126
Unfolding of Double-Pushout Graph Grammars is a Coreflection 124
A Logic for Analyzing Abstractions of Graph Transformation Systems 121
A category of compositional domain-models for separable Stone spaces 119
Coreflective Concurrent Semantics for Single-Pushout Graph Grammars 117
Behavioral Comparison of Process Models Based on Canonically Reduced Event Structures 114
Concurrent semantics of algebraic graph transformations 114
Verifying Finite-State Graph Grammars: an Unfolding-Based Approach 112
Relating SPO and DPO graph rewriting with Petri nets having read, inhibitor and reset arcs 112
A Temporal Graph Logic for Verification of Graph Transformation Systems 112
Bisimulation by Unification 111
Generating Test Cases for Code Generators by Unfolding Graph Transformation Systems 108
Adhesivity Is Not Enough: Local Church-Rosser Revisited 108
A Static Analysis Technique for Graph Transformation Systems 108
A Fixed Point Theorem in a Category of Compact Metric Spaces 107
A framework for the verification of infinite-state graph transformation systems 107
Approximating the Behaviour of Graph Transformation Systems 105
MuTACLP: A language for temporal reasoning with multiple theories 104
Concurrent Rewriting for Graphs with Equivalences 104
A Characterization of Distance between 1-Bounded Compact Ultrametric Spaces through a Universal Space 104
Concatenable Graph Processes: Relating Processes and Derivation Traces 103
Domain and Event Structure Semantics for Petri Nets with Read and Inhibitor Arcs 102
On the Concurrent Semantics of Algebraic Graph Grammars 102
A causal view on non-interference 101
Compositional Modeling of Reactive Systems Using Open Nets 100
Partializing Stone Spaces Using SFP Domains 100
Intransitive Non-Interference by Unfolding 99
Concurrency for graph grammars (in a Petri net shell) 99
Towards a Notion of Transaction in Graph Rewriting 99
History Preserving Bisimulation for Contextual Nets 98
Encoding Synchronous Interactions Using Labelled Petri Nets 97
A semantic framework for open processes 96
Unfolding Graph Transformation Systems: Theory and Applications to Verification 96
Unfolding-Based Diagnosis of Systems with an Evolving Topology 95
Domains and event structures for fusions 93
Symbolic Equivalences for Open Systems 91
A rewriting calculus for cyclic higher-order term graphs 91
Pre-nets, read arcs and unfolding: a functorial presentation 89
A rewriting calculus for cyclic higher-order term graphs 88
Graph Transactions as Processes 87
Open Petri Nets: Non-deterministic Processes and Compositionality 87
Modular encoding of synchronous and asynchronous interactions using open Petri nets 87
Concurrency Can't Be Observed, Asynchronously 85
Bisimulation Equivalences for Graph Grammars 84
Deducing Interactions in Partially Unspecified Biological Systems 84
A lattice-theoretical perspective on adhesive categories 84
Verifying a Behavioural Logic for Graph Transformation Systems 83
Unfolding and Event Structure Semantics for Graph Grammars 82
Concurrency Can't Be Observed, Asynchronously 81
Sharing in the Graph Rewriting Calculus 81
Comparing Metabolic Pathways through Reactions and Potential Fluxes 81
Basic theory of F-bounded quantification 80
Asynchronous traces and open petri nets 80
McMillan's Complete Prefix for Contextual Nets 79
Efficient contextual unfolding 77
Reduction of event structures under history preserving bisimulation 77
Representing and Comparing Metabolic Pathways as Petri Nets with MPath2PN and CoMeta 76
null 76
Local model checking in a logic for true concurrency 76
Functorial Concurrent Semantics for Petri Nets with Read and Inhibitor Arcs 75
Contextual Petri nets, asymmetric event structures and processes 75
Processes for Adhesive Rewriting Systems 73
Encoding Asynchronous Interactions Using Open Petri Nets 73
An Event Structure Semantics for P/T Contextual Nets: Asymmetric Event Structures 73
CONCUR 2014 – Concurrency Theory 72
Behavior Preservation in Model Refactoring using DPO Transformations with Borrowed Contexts 72
Bisimilarity and and Behaviour-Preserving Reconfigurations of Open Petri Nets 71
Petri nets for modelling metabolic pathways: a survey 71
Distributed Unfolding of Petri Nets 70
Multilevel transitive and intransitive non-interference, causally 70
A Logic for True Concurrency 69
Unfolding-based diagnosis of systems with an evolving topology 68
Modelling Calculi with Name Mobility using Graphs with Equivalences 65
Unfolding semantics of graph transformation 65
Composition and Decomposition of DPO Transformations with Borrowed Context 65
Automata for true concurrency properties 64
Compositional Semantics for Open Petri Nets based on Deterministic Processes 63
Unfolding Grammars in Adhesive Categories 62
On the Computation of McMillan's Prefix for Contextual Nets and Graph Grammars 61
Non-interference by Unfolding 60
Multilevel Transitive and Intransitive Non-interference, Causally 60
Many-to-many information flow policies 59
Towards a sharing strategy for the graph rewriting calculus 58
Efficient unfolding of contextual Petri nets 57
Specifying and Verifying UML Activity Diagrams via Graph Transformation 57
Hereditary History-Preserving Bisimilarity: Logics and Automata 55
A Logic for True Concurrency 55
Behavioral Metrics via Functor Lifting 54
Functorial and Non-Functorial Solution of Metric Domain Equations 53
Processes and Unfoldings: Concurrent Computations in Adhesive Categories 52
Proceedings of the Workshop on Petri Nets and Graph Transformation (PNGT 2006) 51
BP-Diff: A Tool for Behavioral Comparison of Business Process Models 51
High-Level Net Processes 49
Petri nets for modelling and analysing trophic networks 49
Many-to-many information flow policies 48
Petri nets for modelling and analysing trophic networks 46
Modelling Concurrent Computations: from Contextual Petri Nets to Graph Grammars 44
Verifying Red-Black Trees 41
From Petri Nets to Graph Transformation Systems 41
Graph Grammar Verification through Abstraction 39
Totale 8.159
Categoria #
all - tutte 28.101
article - articoli 8.815
book - libri 123
conference - conferenze 0
curatela - curatele 657
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 2.456
Totale 40.152


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019793 0 0 0 0 0 0 0 0 0 167 341 285
2019/20201.859 274 54 32 152 208 187 181 250 213 154 58 96
2020/20211.363 51 106 35 144 22 105 46 143 251 109 156 195
2021/20221.613 42 166 331 79 34 59 76 198 70 26 219 313
2022/2023826 238 0 1 71 173 99 1 53 114 16 43 17
2023/2024267 21 58 41 44 14 16 17 27 11 18 0 0
Totale 8.755