Výsledky vyhledávání - "Network of automata"

Analysis of the Driving Force of Land Use Change Based on Geographic Detection and Simulation of Future Land Use Scenarios

Autor: Fengqiang Wu, Caijian Mo, Xiaojun Dai

Publikováno v: Sustainability; Volume 14; Issue 9; Pages: 5254

Land use and land cover changes (LULCC) are the result of the combined action of many influencing factors such as nature, society, economy and politics. Taking Chongqing as an example, the driving factors of urban land expansion in Chongqing from 199

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2ee0e4826f58d59db7a2acdc0b1a2eeb
https://doi.org/10.3390/su14095254

Zobrazit plný text záznamu

Compositional Verification of Asynchronous Concurrent Systems using CADP

Autor: Radu Mateescu, Frédéric Lang, Hubert Garavel

Publikováno v: Acta Informatica
Acta Informatica, Springer Verlag, 2015, 52 (4), pp.56. ⟨10.1007/s00236-015-0226-1⟩
Acta Informatica, 2015, 52 (4), pp.56. ⟨10.1007/s00236-015-0226-1⟩

International audience; During the last decades, concurrency theory successfully developed salient concepts to formally model and soundly reason about distributed and parallel systems. In practice, however, most attempts at analyzing large systems fa

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::87caf61326f9cc77b90b04ff9cd97b24
https://hal.inria.fr/hal-01247507

Zobrazit plný text záznamu

Compositional Verification of Asynchronous Concurrent Systems using CADP (extended version)

Autor: Garavel, Hubert, Lang, Frédéric, Mateescu, Radu

Publikováno v: [Research Report] RR-8708, INRIA Grenoble-Rhône-Alpes. 2015

During the last decades, concurrency theory successfully developed salient concepts to formally model and soundly reason about distributed and parallel systems. In practice, however, most attempts at analyzing large systems face severe complexity iss

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::4b024fd3f6ee54d36002a13b8635db1a
https://hal.inria.fr/hal-01138749/document

Zobrazit plný text záznamu

Algorithmic causal sets for a computational spacetime

Autor: Bolognesi T.

Publikováno v: A Computable Universe: Understanding and Exploring Nature as Computation, edited by Hector Zenil, pp. 459–486. Singapore: World Scientific, 2013
info:cnr-pdr/source/autori:Bolognesi T./titolo:Algorithmic causal sets for a computational spacetime/titolo_volume:A Computable Universe: Understanding and Exploring Nature as Computation/curatori_volume:Hector Zenil/editore: /anno:2013

In this paper we discuss some achievements and ongoing investigations at the intersection between two active research areas: we refer to the first one, somewhat older, broader and fuzzier, by the name 'Computational Universe Conjecture'; the second i

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c703f09ed1a6734f5c48caf15d5afb14
https://openportal.isti.cnr.it/doc?id=people______::c703f09ed1a6734f5c48caf15d5afb14

Zobrazit plný text záznamu

Causal sets from simple models of computation

Autor: Bolognesi T.

Publikováno v: International journal of unconventional computing 6 (2010): 489–524.
info:cnr-pdr/source/autori:Bolognesi T./titolo:Causal sets from simple models of computation/doi:/rivista:International journal of unconventional computing/anno:2010/pagina_da:489/pagina_a:524/intervallo_pagine:489–524/volume:6

Causality among events is widely recognized as a most fundamental structure of spacetime, and causal sets have been proposed as discrete models of the latter in the context of quantum gravity theories, notably in the Causal Set Programme. In the rath

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::1c377d74d640ce8dfcde7506222550a3
https://openportal.isti.cnr.it/doc?id=people______::1c377d74d640ce8dfcde7506222550a3

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání