656 search results - page 14 / 132 » A Formalization of Transition P Systems |
EMSOFT
2005
Springer
15 years 3 months ago
2005
Springer
Hybrid systems are an appropriate formalism to model embedded systems as they capture the theme of continuous dynamics with discrete control. A simple extension, a network of comm...
IANDC
2010
14 years 8 months ago
2010
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
ENTCS
2007
14 years 9 months ago
2007
The aim of the paper is to revisit the model of Biological Regulatory Networks (BRN) which was proposed by René Thomas to model the interactions between a set of genes. We give a...
JCP
2007
14 years 9 months ago
2007
— In this paper we present a formal description of PROSA, a P2P resource management system heavily inspired by social networks. Social networks have been deeply studied in the la...
85
Voted
SIGSOFT
2003
ACM
15 years 10 months ago
2003
ACM
State machine based formalisms such as labelled transition systems (LTS) are generally assumed to be complete descriptions m behaviour at some level of abstraction: if a labelled ...