Filters








1,730 Hits in 2.8 sec

On the Complexity of Concurrent Multiset Rewriting

Marin Bertier, Matthieu Perrin, Cédric Tedeschi
2016 International Journal of Foundations of Computer Science  
In this paper, we are interested in the runtime complexity of programs based on multiset rewriting.  ...  At run time, these rewrite operations are applied concurrently, until no rule can be applied anymore (the set of elements they need cannot be found in the multiset anymore).  ...  More formally speaking, these artificial chemistries [12] rely on concurrent multiset rewriting.  ... 
doi:10.1142/s0129054116500052 fatcat:a2yelz5ulfdqhbctpqyfvarf7q

Relating State-Based and Process-Based Concurrency through Linear Logic

Iliano Cervesato, Andre Scedrov
2006 Electronical Notes in Theoretical Computer Science  
properties of ω-multisets (with one exception).  ...  Specifically, we present a new semantics for multiset rewriting founded on an alternative view of linear logic.  ...  Acknowledgments We are grateful to Frank Pfenning, Dale Miller, Mark-Oliver Stehr, Valeria de Paiva, Gerald Allwein, Steve Zdancevic and Vijay Saraswat for their comments on various aspects of this work  ... 
doi:10.1016/j.entcs.2006.05.043 fatcat:eavrmrbudjbvbhnu2zlxecsd2e

Rewriting Models of Boolean Programs [chapter]

Ahmed Bouajjani, Javier Esparza
2006 Lecture Notes in Computer Science  
We study the classes of rewrite systems induced by programs with different features like procedures, concurrency, or dynamic thread creation, and survey a number of results on their word problem and their  ...  We show that rewrite systems can be used to give semantics to imperative programs with boolean variables, a class of programs used in software model-checking as over-or underapproximations of real programs  ...  Each one of these features leads to an infinite state space, and to questions about the decidability and complexity of analysis problems.  ... 
doi:10.1007/11805618_11 fatcat:qjgi46t5vvcttkfe4rgagibvfq

Metric Denotational Semantics for Parallel Rewriting of Multisets

Gabriel Ciobanu, Eneia Nicolae Todoran
2011 2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing  
of maximal parallelism, and computations are specified by means of multiset rewriting rules.  ...  We present a denotational semantics designed with metric spaces and continuations for an abstract concurrent language embodying two new features: the semantics of parallel composition is based on the concept  ...  by means of multiset rewriting rules.  ... 
doi:10.1109/synasc.2011.20 dblp:conf/synasc/CiobanuT11 fatcat:uy6fuzodung3hel3gmxrs5wosu

Relating state-based and process-based concurrency through linear logic (full-version)

Iliano Cervesato, Andre Scedrov
2009 Information and Computation  
This paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones.  ...  Specifically, we present a new semantics for multiset rewriting founded on an alternative view of linear logic and specifically LV obs .  ...  of this work.  ... 
doi:10.1016/j.ic.2008.11.006 fatcat:p3nbvcukzbeqrfha4k32llbk4a

Relating Two Metric Semantics for Parallel Rewriting of Multisets

Gabriel Ciobanu, Eneia Nicolae Todoran
2012 2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing  
features: parallel composition is based on maximal parallelism, and computations are specified by means of multiset rewriting rules.  ...  We relate these semantics, and compare them in terms of this combination of concepts. The semantic models are designed by using continuations for concurrency.  ...  To the best of our knowledge, this is the first attempt to present a study of comparative semantics for concurrent languages based on the parallel rewriting of multisets. II.  ... 
doi:10.1109/synasc.2012.35 dblp:conf/synasc/CiobanuT12 fatcat:lsmara6znrbkhfle7u6btsmfxa

Continuation Semantics for Dynamic Hierarchical Systems

Gabriel Ciobanu, Eneia Nicolae Todoran
2015 2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)  
The behaviour of each membrane is specified by means of multiset rewriting rules. The semantics of parallel composition in LMB is based on the concept of maximal parallelism.  ...  Computations proceed according to the multiset rewriting rules, nondeterministically choosing the rules and the objects.  ...  Also, in [5] , [6] we applied continuation semantics for concurrency [15] , [7] in designing a denotational semantics for a multiset rewriting concurrent language.  ... 
doi:10.1109/synasc.2015.52 dblp:conf/synasc/CiobanuT15 fatcat:uajmvwa6ezaqnbejojaayjyouu

LinGraph: a graph-based automated planner for concurrent task planning based on linear logic

Sıtar Kortik, Uluc̣ Saranli
2017 Applied intelligence (Boston)  
Following these results, we also show that plan construction with LinGraph is equivalent to multiset rewriting systems, formally relating LinGraph to intuitionistic linear logic.  ...  We show that even though LinGraph does not rely on any heuristics, it still outperforms these systems for concurrent domains with large numbers of identical objects and agents.  ...  Ozan Kahramanogulları for his feedback on our work.  ... 
doi:10.1007/s10489-017-0936-x fatcat:ztt7l3qv4zaffa4yhhycykdyba

Page 7021 of Mathematical Reviews Vol. , Issue 89M [page]

1989 Mathematical Reviews  
For proving the termination of term-rewriting systems, an ordering on S (the set of terms) is built up incrementally and transformed into an order on multisets on S. N. Dershowitz and Z.  ...  This order, called the standard multiset ordering, has proved useful in proofs of program termination and term-rewriting systems termination because it is well-founded whenever the order on S is.  ... 

An abstract machine for reasoning about situations, actions, and causality [chapter]

Kerstin Eder, Steffen Hölldobler, Michael Thielscher
1996 Lecture Notes in Computer Science  
Obviously, an initial plan could consist of the sequential execution of the actions enter and turn-on-TV .  ...  In the first part of this paper we will concentrate on modeling actions as firstclass objects and hierarchical plans within an equational logic framework on the basis of [7] .  ...  One should observe that the mgu of two terms itself can be computed by multiset rewritings (cf. [11] ). We slightly changed the airlock mechanism of the CHAM to fit our purposes.  ... 
doi:10.1007/3-540-60983-0_9 fatcat:lhwiun5s3fa2fasifeebetcmzq

Principles of Maude

M. Clavel, S. Eker, P. Lincoln, J. Meseguer
1996 Electronical Notes in Theoretical Computer Science  
This paper introduces the basic concepts of the rewriting logic language Maude and discusses its implementation.  ...  Control of the rewriting computation is achieved through internal strategy languages de ned inside the logic.  ...  Our previous work with Joseph Goguen and the other membersof the OBJ team has also in uenced the development of our ideas.  ... 
doi:10.1016/s1571-0661(04)00034-9 fatcat:whsrmdsryve4xjqtxe4ih2ayt4

Rewriting Logic Specification of Membrane Systems with Promoters and Inhibitors

Oana Agrigoroaiei, Gabriel Ciobanu
2009 Electronical Notes in Theoretical Computer Science  
Since rewriting logic is a general framework for concurrent systems, we connect it with the operational semantics of membrane systems.  ...  Dynamic allocation allows translation of the maximal parallel application of membrane rules into sequential rewritings. An implementation in Maude is provided.  ...  Acknowledgement We thank the referees for their useful suggestions which improved the paper.  ... 
doi:10.1016/j.entcs.2009.05.010 fatcat:za7i4bica5ftvkmvrcjuejieey

Rewriting Logic and Maude: A Wide-Spectrum Semantic Framework for Object-Based Distributed Systems [chapter]

José Meseguer
2000 IFIP Advances in Information and Communication Technology  
Both the distributed states and the local concurrent transitions of such systems can be naturally specified by rewrite theories in which such local concurrent transitions are described by rewrite rules  ...  As a wide-spectrum semantic framework, rewriting logic can span the gap between high-level properties and architectural designs on the one hand, and distributed or mobile system implementations on the  ...  The work on rewriting logic and Maude is ajoint research effort with all my colleagues in the Maude team, with Carolyn Talcott at Stanford University, and with other colleagues and research teams in the  ... 
doi:10.1007/978-0-387-35520-7_5 fatcat:7oy4kfnjxnadxmojkv7jv34t3q

An Operational Semantics of Graph Transformation Systems Using Symmetric Nets

Lorenzo Capra
2019 Electronic Proceedings in Theoretical Computer Science  
Petri nets (PN), on the other side, are a central and intuitive formalism for concurrent or distributed systems, well supported by a number of analysis techniques/tools.  ...  Some practical exploitations of the proposed operational semantics are discussed.  ...  In general, checking whether the rules of a GTS may concurrently take place (possibly identifying parametric concurrent subsets of rule instances) involves more complex calculations: think, e.g., of indirect  ... 
doi:10.4204/eptcs.303.8 fatcat:nahjms4a6ne5pkdqtcoouchjdy

Foundations of Reversible Computation [chapter]

Bogdan Aman, Gabriel Ciobanu, Robert Glück, Robin Kaarsgaard, Jarkko Kari, Martin Kutrib, Ivan Lanese, Claudio Antares Mezzina, Łukasz Mikulski, Rajagopal Nagarajan, Iain Phillips, G. Michele Pinna (+3 others)
2020 Lecture Notes in Computer Science  
Just one assumption on rules is made, namely that rules are not allowed to rewrite a multiset of objects into an empty multiset: the application of a rule must have an effect, though this could be not  ...  However, in the case of true multisets of actions executed simultaneously, one needs to allow mixed reverses (i.e., steps where both forward and backward actions are present) and true concurrent reversing  ... 
doi:10.1007/978-3-030-47361-7_1 fatcat:3qgnwqrqnvdltkqjbuzfgx7wty
« Previous Showing results 1 — 15 out of 1,730 results