| Nome |
# |
|
Reachability computation for polynomial dynamical systems, file e27ce0c4-8561-055e-e053-6605fe0a7873
|
424
|
|
A graph-theoretic approach to map conceptual designs to XML schemas, file e27ce0c1-e559-055e-e053-6605fe0a7873
|
189
|
|
Unwinding biological systems, file e27ce0c2-5fb4-055e-e053-6605fe0a7873
|
176
|
|
PicNIc - Pi-calculus Non-Interference checker, file e27ce0c3-3038-055e-e053-6605fe0a7873
|
162
|
|
Rank and simulation: the well-founded case, file e27ce0c2-689e-055e-e053-6605fe0a7873
|
154
|
|
Information flow in secure contexts, file e27ce0c1-cd55-055e-e053-6605fe0a7873
|
151
|
|
ϵ-Semantics computations on biological systems, file e27ce0c3-2e62-055e-e053-6605fe0a7873
|
127
|
|
Games, Automata, Logics, and Formal Verification (GandALF2014) - Preface, file e27ce0c4-f4fc-055e-e053-6605fe0a7873
|
125
|
|
Lumping-based equivalences in Markovian automata: Algorithms and applications to product-form analyses, file e27ce0c7-9d14-055e-e053-6605fe0a7873
|
116
|
|
Approximated Symbolic Computations over Hybrid Automata, file e27ce0c1-e9eb-055e-e053-6605fe0a7873
|
114
|
|
Is Hyper-extensionality Preservable under Deletions of Graph Elements?, file e27ce0c7-9d24-055e-e053-6605fe0a7873
|
112
|
|
A uniform approach to constraint-solving for lists, multisets, compact lists, and sets, file e27ce0c1-f1b1-055e-e053-6605fe0a7873
|
109
|
|
External Control in Process Algebra for Systems Biology, file e27ce0c1-d81f-055e-e053-6605fe0a7873
|
103
|
|
From Bisimulation to Simulation: Coarsest Partition Problems, file e27ce0c3-3780-055e-e053-6605fe0a7873
|
100
|
|
Sets and Constraint Logic Programming, file e27ce0c3-3753-055e-e053-6605fe0a7873
|
67
|
|
Proceedings Fifth International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2014, Verona, Italy, September 10-12, 2014, file e27ce0c2-474e-055e-e053-6605fe0a7873
|
63
|
|
Discrete Semantics for Hybrid Automata, file e27ce0c3-415a-055e-e053-6605fe0a7873
|
62
|
|
Hybrid automata, reachability, and Systems Biology, file e27ce0c1-d45e-055e-e053-6605fe0a7873
|
45
|
|
Lumping-based equivalences in Markovian automata: Algorithms and applications to product-form analyses, file e27ce0c7-5114-055e-e053-6605fe0a7873
|
35
|
|
Proportional lumpability and proportional bisimilarity, file e27ce0c9-9526-055e-e053-6605fe0a7873
|
33
|
|
Model Checking on Hybrid Automata: Theory and Application to Biological Systems, file e27ce0c1-e28c-055e-e053-6605fe0a7873
|
32
|
|
Rank-Based Symbolic Bisimulation (and Model Checking), file e27ce0c1-d7bd-055e-e053-6605fe0a7873
|
28
|
|
Compositional information flow security for concurrent programs, file e27ce0c1-ccff-055e-e053-6605fe0a7873
|
25
|
|
An Efficient Algorithm for Computing Bisimulation Equivalence, file e27ce0c3-36b0-055e-e053-6605fe0a7873
|
25
|
|
An ASP Approach for the Synthesis of CNOT Minimal Quantum Circuits, file 5648098b-1b85-4b52-af02-ec6c7766b92c
|
23
|
|
Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice, file e27ce0c3-37b8-055e-e053-6605fe0a7873
|
22
|
|
Inclusion dynamics hybrid automata, file e27ce0c3-39d0-055e-e053-6605fe0a7873
|
19
|
|
Hybrid Automata in Systems Biology: How far can we go?, file e27ce0c1-df44-055e-e053-6605fe0a7873
|
17
|
|
Simulating Polyadic Modal Logics by Monadic Ones, file e27ce0c3-395c-055e-e053-6605fe0a7873
|
17
|
|
Computing strongly connected components in a linear number of symbolic steps, file e27ce0c1-e034-055e-e053-6605fe0a7873
|
16
|
|
Hybrid Automata and epsilon-Analysis on a Neural Oscillator, file e27ce0c1-dfe7-055e-e053-6605fe0a7873
|
11
|
|
Rank-Based Simulation on Acyclic Graphs, file e27ce0c1-e6c6-055e-e053-6605fe0a7873
|
11
|
|
Set-Based Invariants over Polynomial Systems, file fc14e2b4-5ec6-47a1-bc27-fb3e2457eb2f
|
8
|
|
Quantum encoding of dynamic directed graphs, file 50a5e354-7e86-46f5-8dc2-957a7164d2e3
|
6
|
|
Hybrid Automata in Systems Biology: How far can we go?, file e27ce0c1-df43-055e-e053-6605fe0a7873
|
5
|
|
Sets and Constraint Logic Programming, file e27ce0c3-377d-055e-e053-6605fe0a7873
|
5
|
|
Reachability computation for polynomial dynamical systems, file e27ce0c4-e8f0-055e-e053-6605fe0a7873
|
5
|
|
Information flow in secure contexts, file e27ce0c1-cd56-055e-e053-6605fe0a7873
|
4
|
|
A uniform approach to constraint-solving for lists, multisets, compact lists, and sets, file e27ce0c1-f1b2-055e-e053-6605fe0a7873
|
4
|
|
External Control in Process Algebra for Systems Biology, file e27ce0c1-d820-055e-e053-6605fe0a7873
|
3
|
|
Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice, file e27ce0c1-f1db-055e-e053-6605fe0a7873
|
3
|
|
Rank and simulation: the well-founded case, file e27ce0c2-689f-055e-e053-6605fe0a7873
|
3
|
|
Towards quantum programs verification: from quipper circuits to QPMC, file e27ce0c2-f9fb-055e-e053-6605fe0a7873
|
3
|
|
LINC01605 Is a Novel Target of Mutant p53 in Breast and Ovarian Cancer Cell Lines, file 8350cea6-3f7b-49ac-94b4-055d5ac16837
|
2
|
|
Compositional information flow security for concurrent programs, file e27ce0c1-cd00-055e-e053-6605fe0a7873
|
2
|
|
Model Checking on Hybrid Automata: Theory and Application to Biological Systems, file e27ce0c1-e28b-055e-e053-6605fe0a7873
|
2
|
|
Inclusion dynamics hybrid automata, file e27ce0c1-e97b-055e-e053-6605fe0a7873
|
2
|
|
Symbolic Graphs: Linear Solutions to Connectivity Related Problems, file e27ce0c1-ebe5-055e-e053-6605fe0a7873
|
2
|
|
From Entity Relationship to XML Schema: A Graph-Theoretic Approach, file e27ce0c1-ed5c-055e-e053-6605fe0a7873
|
2
|
|
An Efficient Algorithm for Computing Bisimulation Equivalence, file e27ce0c1-f1b4-055e-e053-6605fe0a7873
|
2
|
|
The Subgraph Bisimulation Problem, file e27ce0c5-504f-055e-e053-6605fe0a7873
|
2
|
|
Synthesis of CNOT minimal quantum circuits with topological constraints through ASP, file 14e63828-9b4c-4118-9f6d-4049492515dc
|
1
|
|
Adaptive Directions for Bernstein-Based Polynomial Set Evolution, file 3457c3c9-2bf5-4ca1-9610-37ff286ca80c
|
1
|
|
Draft genome sequences of 14 Lacticaseibacillus spp. strains, representatives of a collection of 200 strains, file 976ac101-086f-431c-800d-6f2ddbb528a8
|
1
|
|
Multiset Constraints and P Systems, file e27ce0c1-c7f6-055e-e053-6605fe0a7873
|
1
|
|
From Bisimulation to Simulation: Coarsest Partition Problems, file e27ce0c1-cc42-055e-e053-6605fe0a7873
|
1
|
|
Hybrid automata, reachability, and Systems Biology, file e27ce0c1-d45d-055e-e053-6605fe0a7873
|
1
|
|
Algorithmic Algebraic Model Checking I:
Challenges from Systems Biology⋆, file e27ce0c1-dbf1-055e-e053-6605fe0a7873
|
1
|
|
Ackermann Encodings, Bisimulations, and OBDDs, file e27ce0c1-eabb-055e-e053-6605fe0a7873
|
1
|
|
Discrete Semantics for Hybrid Automata, file e27ce0c1-eb62-055e-e053-6605fe0a7873
|
1
|
|
Morphos Configuration Engine: the Core of a Commercial Configuration System in CLP(FD), file e27ce0c1-ec92-055e-e053-6605fe0a7873
|
1
|
|
Unwinding biological systems, file e27ce0c2-693c-055e-e053-6605fe0a7873
|
1
|
|
ϵ-Semantics computations on biological systems, file e27ce0c3-2e63-055e-e053-6605fe0a7873
|
1
|
|
Simulating Polyadic Modal Logics by Monadic Ones, file e27ce0c3-374d-055e-e053-6605fe0a7873
|
1
|
|
A graph-theoretic approach to map conceptual designs to XML schemas, file e27ce0c3-3a03-055e-e053-6605fe0a7873
|
1
|
| Totale |
2.792 |