A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Typed Mobile Ambients in Maude
2006
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
We enrich the operational semantics with error rules and prove that well-typed processes do not produce such errors. The type system is highly non-deterministic. ...
Section 5 enriches the semantics with error rules and implements the type system for avoiding communication errors. Finally Section 6 gives conclusions and future work. ...
If we apply it from right to left we cannot see how the system evolves when new copies of the replicated process interact with other parts of the system or even with other copies of itself. ...
doi:10.1016/j.entcs.2005.06.041
fatcat:77zgslxvive5lcwoymbbuwo33q
On Bisimilarity and Substitution in Presence of Replication
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We obtain this characterisation using a rewriting system rather than a purely equational axiomatisation. We then deduce substitution closure, and hence, congruence. ...
Whether bisimilarity is a congruence when replications are unrestricted remains open. ...
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
From Active Names to π-calculus Rewriting Rules
2005
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
There, agents active names are calculated from their corresponding Labelled Transition Systems (LTS) and, because of this, cannot be directly applied to rewriting systems. ...
With these new rules, π-expressions are better reduced (more useless code is discarded) enriching the equivalence classes of agents. ...
Guarded replicated agents is necessary to find a normal form in rewriting systems. ...
doi:10.1016/j.entcs.2005.03.010
fatcat:elaf7o6tcvgklnc67lztsuhuge
A Translation of the Pi-Calculus Into MONSTR
[chapter]
1996
J.UCS The Journal of Universal Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The correctness proof illustrates many features typically encountered in reasoning about graph rewriting systems, and particularly how serialisation techniques can be used to reorder an arbitrary execution ...
A translation of the π-calculus into the MONSTR graph rewriting language is described and proved correct. ...
Definition 3.4 A closed π-calculus system evolves using the replication rewrite rule !P → R P | ! ...
doi:10.1007/978-3-642-80350-5_32
fatcat:bh6vsv2c35ayfjr67qnsbjao6i
Rewriting P systems: improved hierarchies
2005
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This result is then used to improve several universality results from various membrane computing papers, for instance, about P systems with replicated rewriting, with leftmost rewriting, with conditional ...
communication, as well as for hybrid P systems with finite choice. ...
The inclusion RP * (i/o) ⊆ MAT was proved in
Replicated rewriting Here we consider a variant of rewriting P systems, i.e., P systems with replicated rewriting [6] , where the evolution rules are replicated ...
doi:10.1016/j.tcs.2004.06.015
fatcat:zseysmpnn5bhplihkagkzi7voq
On characterising strong bisimilarity in a fragment of CCS with replication
[article]
2008
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
The characterisation is not an axiomatisation, but is instead presented as a rewriting system. ...
We provide a characterisation of strong bisimilarity in a fragment of CCS that contains only prefix, parallel composition, synchronisation and 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
Chromatin computation: Epigenetic inheritance as a pattern reconstruction problem
2013
Journal of Theoretical Biology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It is efficient enough to use an evolutionary algorithm to find patterns across multiple cell divisions with high accuracy. ...
A plausible hypothesis is that the different combinations of reader and writer domains in histone-modifying enzymes implement local rewriting rules that are capable of "recomputing" the desired parental ...
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
Stable Availability under Denial of Service Attacks through Formal Patterns
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
and the Server Replicator (SR) pattern, which provisions additional resources on demand. ...
The underlying executable specification formalism we use is the rewriting logic language Maude and its real-time and probabilistic extensions. ...
A parameterized module M [X : : P ] has a formal parameter X satisfying a parameter theory P ; M can be instantiated by another module Q via a theory interpretation V : P −→ Q, called a view, with the ...
doi:10.1007/978-3-642-28872-2_6
fatcat:4r4otfp6ubcg7onwdgvdgd6woe
Input/Output for ELAN
1996
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
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
A causal semantics for CCS via rewriting logic
2002
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We consider two operational semantics for CCS deÿned in the literature: the ÿrst exploits proved transition systems (PTS) and the second rewriting logic (RL). ...
Let ccs be the one-sorted signature (with sort S P ) associated with CCS processes: each action is a unary operator, and so is each restriction ( a) and replication ! ...
The CCS transition system is the Table 1 The transition system for CCS act: − :P → P sum 0 : P → P P + Q → P sum 1 : P → P Q + P → P act ! : − !a:P a →! ...
doi:10.1016/s0304-3975(01)00165-7
fatcat:5jxfkymkg5c25ipgea4ca2ywpu
A Secret-Sharing Protocol Modelled in Maude
2004
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Meta-objects are used to factor the specification of the first asynchronous, proactive, secret-sharing protocol into secret-sharing, replication and encryption layers. ...
The dynamics of the system is specified by rewrite rules, whose most general form is r : M 1 . . . ...
Sets P 1 , . . . , P l of t servers represent the worst-case failure scenarios. Given a sharing s 1 , . . . , s l of a secret, each share s i is associated with failure scenario P i . ...
doi:10.1016/s1571-0661(05)82537-x
fatcat:sr23rmiztnbmphdibznxmvnleu
A query algebra for xml p2p databases
2004
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters - WWW Alt. '04
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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 ...
indicates that the replica is always kept up to date); given the dynamic nature of the system, we expect replication constraints to evolve over time. ...
In the field of database research, p2p systems affirmed as an interesting evolution of past distributed and integration systems. ...
doi:10.1145/1013367.1013424
dblp:conf/www/Sartiani04
fatcat:x3cdywc6ofhyhazp5iowu3p4xi
A query algebra for xml p2p databases
2004
Alternate track papers & posters of the 13th international conference on World Wide Web - WWW Alt. '04
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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 ...
indicates that the replica is always kept up to date); given the dynamic nature of the system, we expect replication constraints to evolve over time. ...
In the field of database research, p2p systems affirmed as an interesting evolution of past distributed and integration systems. ...
doi:10.1145/1010432.1010489
fatcat:sm37ezrfdjbcrkvakhuf3xdade
A Query Algebra for XML P2P Databases
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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 ...
indicates that the replica is always kept up to date); given the dynamic nature of the system, we expect replication constraints to evolve over time. ...
In the field of database research, p2p systems affirmed as an interesting evolution of past distributed and integration systems. ...
doi:10.1007/11896548_48
fatcat:chxxpw4i6nadza74a32wjr235e
Mobile Processes and Termination
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The second approach exploits notions from term rewriting. ...
Processes are π-calculus processes, on which type systems are imposed that ensure termination of the process computations. Two approaches are exposed. ...
We have also beneted from comments and interactions with Naoki Kobayashi. ...
doi:10.1007/978-3-642-04164-8_13
fatcat:oz6bkcbdjbcvbirjq3p5jnsvky
« Previous
Showing results 1 — 15 out of 37,425 results