Zobrazeno 1 - 10
of 112
pro vyhledávání: '"Klaudel, Hanna"'
We study the complexity relationship between three models of unbounded memory automata: nu-automata ($\nu$-A), Layered Memory Automata (LaMA)and History-Register Automata (HRA). These are all extensions of finite state automata with unbounded memory
Externí odkaz:
http://arxiv.org/abs/2307.03561
We formalise and study multi-agent timed models MAPTs (Multi-Agent with timed Periodic Tasks), where each agent is associated to a regular timed schema upon which all possibles actions of the agent rely. MAPTs allow for an accelerated semantics and a
Externí odkaz:
http://arxiv.org/abs/1911.07591
ANDy , Activity Networks with Delays, is a discrete time framework aimed at the qualitative modelling of time-dependent activities. The modular and concise syntax makes ANDy suitable for an easy and natural modelling of time-dependent biological syst
Externí odkaz:
http://arxiv.org/abs/1608.07440
Publikováno v:
EPTCS 184, 2015, pp. 5-18
MIRELA is a high-level language and a rapid prototyping framework dedicated to systems where virtual and digital objects coexist in the same environment and interact in real time. Its semantics is given in the form of networks of timed automata, whic
Externí odkaz:
http://arxiv.org/abs/1506.03553
This paper investigates questions related to the modularity in discrete models of biological interaction networks. We develop a theoretical framework based on the analysis of their asymptotic dynamics. More precisely, we exhibit formal conditions und
Externí odkaz:
http://arxiv.org/abs/1111.2313
Publikováno v:
EPTCS 40, 2010, pp. 162-177
In this paper, we aim at modelling and analyzing the regulation processes in multi-cellular biological systems, in particular tissues. The modelling framework is based on interconnected logical regulatory networks a la Rene Thomas equipped with infor
Externí odkaz:
http://arxiv.org/abs/1011.0498
Publikováno v:
EPTCS 39, 2010, pp. 47-61
This paper presents the Pi-graphs, a visual paradigm for the modelling and verification of mobile systems. The language is a graphical variant of the Pi-calculus with iterators to express non-terminating behaviors. The operational semantics of Pi-gra
Externí odkaz:
http://arxiv.org/abs/1011.0220
Publikováno v:
In BioSystems December 2016 150:52-60
Publikováno v:
In Journal of Logic and Algebraic Programming February 2013 82(2):95-110
Publikováno v:
In Theoretical Computer Science 4 May 2012 431:219-234