Filters








26,876 Hits in 8.1 sec

Typed Mobile Ambients in Maude

Fernando Rosa-Velardo, Clara Segura, Alberto Verdejo
2006 Electronical Notes in Theoretical Computer Science  
slightly increased the power of the type system.  ...  Both implementations infer the process type as the result of the rewriting.  ...  have slightly increased the power of the type system.  ... 
doi:10.1016/j.entcs.2005.06.041 fatcat:77zgslxvive5lcwoymbbuwo33q

Input/Output for ELAN

Patrick Viry
1996 Electronical Notes in Theoretical Computer Science  
We show h o w to add Input/Output capabilities to the ELAN rewriting interpreter using a rewrite speci cation of -calculus.  ...  This I/O system has the advantage of being totally explicit and t in the same semantic framework than any other \application program". An actual implementation shows the e ectiveness of this approach.  ...  the opening succeeded, binding 0 with the corresponding channel, or behaving as P Fail i=] in case of failure, binding 0 with a system error number.  ... 
doi:10.1016/s1571-0661(04)00033-7 fatcat:56llq52e6ffsnekvlxybh4xeei

On Bisimilarity and Substitution in Presence of Replication [chapter]

Daniel Hirschkoff, Damien Pous
2010 Lecture Notes in Computer Science  
Our proof relies on algebraic properties of replication, and on a new syntactic characterisation of bisimilarity.  ...  We obtain this characterisation using a rewriting system rather than a purely equational axiomatisation. We then deduce substitution closure, and hence, congruence.  ...  This characterisation relies on a rewriting system for processes (such that P 1 rewrites into P 2 ).  ... 
doi:10.1007/978-3-642-14162-1_38 fatcat:ga4xzzeol5f7xmiy72acdf6r2m

Page 8498 of Mathematical Reviews Vol. , Issue 2002K [page]

2002 Mathematical Reviews  
Friedhelm Meyer auf der Heide (Paderborn) 2002k:68051 68Q05 68Q42 Manca, Vincenzo (I-PISA-IF; Pisa); Martin-Vide, Carlos; Paun, Gheorghe (R-AOS; Bucharest) On the power of P systems with replicated rewriting  ...  We close the paper with some remarks about the closure properties of the families of languages generated by P systems with replicated rewriting. Several open problems are also formulated.”  ... 

Chromatin computation: Epigenetic inheritance as a pattern reconstruction problem

Christian Arnold, Peter F. Stadler, Sonja J. Prohaska
2013 Journal of Theoretical Biology  
modification patterns on the basis of the partial information contained in that half of the nucleosomes that predate replication.  ...  However, the success of this task depends on several previously unanticipated factors, such as the length of the initial state, the specific pattern that should be maintained, the time between replications  ...  This work was supported in part by the Templeton Foundation, grant # 24332 "Origins and Evolution of Regulation in Biological Systems" and the Sächsische Aufbaubank (SAB), grant # 14494.  ... 
doi:10.1016/j.jtbi.2013.07.012 pmid:23880640 fatcat:wfmtlhpmurgjhddvizttlmwbi4

A query algebra for xml p2p databases

Carlo Sartiani
2004 Alternate track papers & posters of the 13th international conference on World Wide Web - WWW Alt. '04  
of data and replicas.  ...  This paper describes a query algebra for queries over XML p2p databases that provides explicit mechanisms for modeling data dissemination, replication constraints, and for capturing the transient nature  ...  Several ongoing projects focus on the design of p2p database systems, mostly for XML data.  ... 
doi:10.1145/1010432.1010489 fatcat:sm37ezrfdjbcrkvakhuf3xdade

A query algebra for xml p2p databases

Carlo Sartiani
2004 Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters - WWW Alt. '04  
of data and replicas.  ...  This paper describes a query algebra for queries over XML p2p databases that provides explicit mechanisms for modeling data dissemination, replication constraints, and for capturing the transient nature  ...  Several ongoing projects focus on the design of p2p database systems, mostly for XML data.  ... 
doi:10.1145/1013367.1013424 dblp:conf/www/Sartiani04 fatcat:x3cdywc6ofhyhazp5iowu3p4xi

A Query Algebra for XML P2P Databases [chapter]

Carlo Sartiani
2006 Lecture Notes in Computer Science  
of data and replicas.  ...  This paper describes a query algebra for queries over XML p2p databases that provides explicit mechanisms for modeling data dissemination, replication constraints, and for capturing the transient nature  ...  Several ongoing projects focus on the design of p2p database systems, mostly for XML data.  ... 
doi:10.1007/11896548_48 fatcat:chxxpw4i6nadza74a32wjr235e

On characterising strong bisimilarity in a fragment of CCS with replication [article]

Daniel Hirschkoff, Damien Pous (INRIA Rhône-Alpes / LIG Laboratoire d'Informatique de Grenoble)
2008 arXiv   pre-print
The characterisation is not an axiomatisation, but is instead presented as a rewriting system.  ...  We discuss how our method allows us to derive a new congruence result in the π-calculus: congruence holds in the sub-calculus that does not include restriction nor sum, and features a limited form of replication  ...  We present a rewriting system that allows us to characterise strong bisimilarity (∼) in a very basic calculus that only features prefixes, parallel composition, and replicated prefixes, with the additional  ... 
arXiv:0810.2061v1 fatcat:anuw6f5w3zgfbee7ok5oykg6fq

On the asymptotic behavior of the solutions to the replicator equation [article]

Georgy P Karev, Artem S Novozhilov, Faina S Berezovskaya
2010 arXiv   pre-print
Selection systems and the corresponding replicator equations model the evolution of replicators with a high level of abstraction.  ...  of the system and under some suitable conditions, that generically one globally stable equilibrium exits on the 1-skeleton of the simplex.  ...  The research of KGP and ASN is supported in part by the Department of Health and Human Services intramural program (NIH, National Library of Medicine).  ... 
arXiv:0906.4986v2 fatcat:qugfpash3rg4ni43w4qxcw5tly

On the asymptotic behaviour of the solutions to the replicator equation

G. P. Karev, A. S. Novozhilov, F. S. Berezovskaya
2010 Mathematical Medicine and Biology  
Selection systems and the corresponding replicator equations model the evolution of replicators with a high level of abstraction.  ...  As an example of the system with the interaction matrix of Rank 2, we consider the problem from Adams & Sornborger (2007, Analysis of a certain class of replicator equations. J. Math.  ...  The initial condition for (4.7) is u(v = 1) = 1. We rewrite (4.7) as a dynamical system on the planė (4.8) where the derivatives are taken with respect to some dummy 'time' variable.  ... 
doi:10.1093/imammb/dqq006 pmid:20435663 pmcid:PMC3107970 fatcat:zubuwb6vhjbajgjngvptq56y64

Deciding Reachability in Mobile Ambients with Name Restriction

Giorgio Delzanno, Roberto Montagna
2009 Electronical Notes in Theoretical Computer Science  
The formalism is based on classical operations of process algebra like action prefix act.P , parallel composition P | Q and replication !P . The replication !  ...  By using a connection with associative-commutative term rewriting, we prove that reachability is decidable in the open-free fragment of pure Mobile Ambients with name restriction and weak reduction semantics  ...  Indeed, the computational mechanisms of public MA can be naturally expressed using rewriting systems working on terms with multiset-variables.  ... 
doi:10.1016/j.entcs.2009.05.027 fatcat:xfzfijdtyjgdzfres72ohwxzi4

A Secret-Sharing Protocol Modelled in Maude

Dilia E. Rodríguez
2004 Electronical Notes in Theoretical Computer Science  
Meta-objects are used to factor the specification of the first asynchronous, proactive, secret-sharing protocol into secret-sharing, replication and encryption layers.  ...  A search strategy is described that exploits the structure of the specification to reduce the search space.  ...  The dynamics of the system is specified by rewrite rules, whose most general form is r : M 1 . . .  ... 
doi:10.1016/s1571-0661(05)82537-x fatcat:sr23rmiztnbmphdibznxmvnleu

Computing with Membranes (P Systems): Universality Results [chapter]

Carlos Martín-Vide, Gheorghe PĂun
2001 Lecture Notes in Computer Science  
We consider both P systems with symbol-objects and with string-objects; in the latter case, we consider systems based on rewriting, splicing, as well as rewriting together with other operations (replication  ...  This is a survey of universality results in the area of Membrane Computing (P systems), at the level of December 2000 1 .  ...  P Systems with Rewriting and Replication Recently, in [18] a variant of rewriting P systems was considered, where rules of the form X → (u 1 , tar 1 )|| . . . ||(u n , tar n ) are used.  ... 
doi:10.1007/3-540-45132-3_5 fatcat:ujsuut5pk5hxjckeaq74q5lql4

Stable Availability under Denial of Service Attacks through Formal Patterns [chapter]

Jonas Eckhardt, Tobias Mühlbauer, Musab AlTurki, José Meseguer, Martin Wirsing
2012 Lecture Notes in Computer Science  
and the Server Replicator (SR) pattern, which provisions additional resources on demand.  ...  We enhance pattern descriptions with formal models that allow the designer to give guarantees on the behavior of the proposed solution.  ...  After that point, the protocol behaves like the original ASV protocol (but with the equivalent of a more powerful server) and the success ratio decreases.  ... 
doi:10.1007/978-3-642-28872-2_6 fatcat:4r4otfp6ubcg7onwdgvdgd6woe
« Previous Showing results 1 — 15 out of 26,876 results