Zobrazeno 1 - 10
of 62
pro vyhledávání: '"Giorgio Bacci"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 312, Iss Proc. QAPL 2019, Pp 29-42 (2020)
When modeling concurrent or cyber-physical systems, non-functional requirements such as time are important to consider. In order to improve the timing aspects of a model, it is necessary to have some notion of what it means for a process to be faster
Externí odkaz:
https://doaj.org/article/965555eb02ff44b4b4b728065f1f6019
Publikováno v:
Logical Methods in Computer Science, Vol Volume 17, Issue 1 (2021)
The probabilistic bisimilarity distance of Deng et al. has been proposed as a robust quantitative generalization of Segala and Lynch's probabilistic bisimilarity for probabilistic automata. In this paper, we present a characterization of the bisimila
Externí odkaz:
https://doaj.org/article/c6f32619ae8444a09335d630eb19c76a
Publikováno v:
Logical Methods in Computer Science, Vol Volume 14, Issue 4 (2018)
In this paper we propose a complete axiomatization of the bisimilarity distance of Desharnais et al. for the class of finite labelled Markov chains. Our axiomatization is given in the style of a quantitative extension of equational logic recently pro
Externí odkaz:
https://doaj.org/article/bc987de65f4d4b95b6f3e02fe032fc3a
Publikováno v:
Logical Methods in Computer Science, Vol Volume 13, Issue 2 (2017)
We propose a distance between continuous-time Markov chains (CTMCs) and study the problem of computing it by comparing three different algorithmic methodologies: iterative, linear program, and on-the-fly. In a work presented at FoSSaCS'12, Chen et al
Externí odkaz:
https://doaj.org/article/20d51ffaea6a44a0b2ec2a6f0224455d
Autor:
Giorgio Bacci, Marino Miculan
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 40, Iss Proc. MeCBIC 2010, Pp 6-22 (2010)
We give a stochastic extension of the Brane Calculus, along the lines of recent work by Cardelli and Mardare. In this presentation, the semantics of a Brane process is a measure of the stochastic distribution of possible derivations. To this end, we
Externí odkaz:
https://doaj.org/article/76ca3457c0204db9a0455f8cea250cb6
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 11, Iss Proc. MeCBIC 2009, Pp 3-18 (2009)
We present a bigraphical framework suited for modeling biological systems both at protein level and at membrane level. We characterize formally bigraphs corresponding to biologically meaningful systems, and bigraphic rewriting rules representing biol
Externí odkaz:
https://doaj.org/article/4a7b033c17f24c8e9c1d3027f19b44e7
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 11, Iss Proc. MeCBIC 2009, Pp 19-33 (2009)
We introduce the BioBeta Framework, a meta-model for both protein-level and membrane-level interactions of living cells. This formalism aims to provide a formal setting where to encode, compare and merge models at different abstraction levels; in par
Externí odkaz:
https://doaj.org/article/76be8e530d5745209b80435326dd4c69
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031223365
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ded4aa465cb9c42c683b814f52e7c31d
https://doi.org/10.1007/978-3-031-22337-2_21
https://doi.org/10.1007/978-3-031-22337-2_21
Autor:
Giorgio Bacci
Publikováno v:
Études de lettres. :99-118
Roberto Innocenti’s illustrations have been qualified as “ contemporary paintings ” by Marco Magnani, inasmuch as they reconcile modernity and tradition, classical systems and new approaches to representation. This article focuses on Innocenti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3e9f1345609f1c7f88ca2344429536e0
https://doi.org/10.4000/edl.1601
https://doi.org/10.4000/edl.1601
Autor:
Max Tschaikowski, Mirco Tribastone, Kim Guldstrand Larsen, Giovanni Bacci, Andrea Vandin, Giorgio Bacci
Publikováno v:
36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
Bacci, G, Bacci, G, Larsen, K G, Tribastone, M, Tschaikowski, M & Vandin, A 2021, Efficient Local Computation of Differential Bisimulations via Coupling and Up-to Methods . in 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) . IEEE, pp. 1-14, 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Rome, Italy, 29/06/2021 . https://doi.org/10.1109/LICS52264.2021.9470555
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
LICS
Bacci, G, Bacci, G, Larsen, K G, Tribastone, M, Tschaikowski, M & Vandin, A 2021, Efficient Local Computation of Differential Bisimulations via Coupling and Up-to Methods . in 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) . IEEE, pp. 1-14, 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Rome, Italy, 29/06/2021 . https://doi.org/10.1109/LICS52264.2021.9470555
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
LICS
We introduce polynomial couplings, a generalization of probabilistic couplings, to develop an algorithm for the computation of equivalence relations which can be interpreted as a lifting of probabilistic bisimulation to polynomial differential equati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3d17762d6502b4e25de575dd5bfa5827