600 Hits in 5.9 sec

LMNtal as a hierarchical logic programming language

Kazunori Ueda
2009 Theoretical Computer Science  
LMNtal is intended to be a substrate language of various computational models, especially those addressing concurrency, mobility and multiset rewriting.  ...  LMNtal (pronounced "elemental") is a simple language model based on hierarchical graph rewriting that uses logical variables to represent connectivity and membranes to represent hierarchy.  ...  Acknowledgments The author is indebted to the past and current members of the LMNtal project, particularly Norio Kato, Shingo Yajima, Ken Mizuno and Shintaro Kudo for the development of the ideas described  ... 
doi:10.1016/j.tcs.2009.07.043 fatcat:swb3tox2l5hsnbm3wwzb7t2zdi

A Graphical Fusion Calculus

Ivan Lanese, Ugo Montanari
2004 Electronical Notes in Theoretical Computer Science  
In the paper we introduce the interleaving semantics for SHR with Milner synchronization and show that there is a complete correspondence between the operational semantics of Fusion Calculus and of SHR  ...  The main difference we see is that Fusion Calculus has an interleaving behaviour while SHR is inherently concurrent.  ...  Introduction In this paper we compare two different kinds of models which are useful for studying concurrent, distributed and mobile systems.  ... 
doi:10.1016/j.entcs.2004.08.026 fatcat:6g232mvjszfonigj3troagogdu

Algorithms for Extended Alpha-Equivalence and Complexity

Manfred Schmidt-Schauß, Conrad Rau, David Sabel, Marc Herbstritt
2013 International Conference on Rewriting Techniques and Applications  
Permutability of bindings in let-constructs and structural congruence axioms extend alpha-equivalence.  ...  Equality of expressions in lambda-calculi, higher-order programming languages, higher-order programming calculi and process calculi is defined as alpha-equivalence.  ...  Acknowledgments We thank the anonymous reviewers for their valuable and helpful comments.  ... 
doi:10.4230/lipics.rta.2013.255 dblp:conf/rta/Schmidt-SchaussRS13 fatcat:zojcz24qonemnbmrown7widgpm

An abstract machine for concurrent modular systems: CHARM

Andrea Corradini, Ugo Montanari, Francesca Rossi
1994 Theoretical Computer Science  
Such equivalence classes of computations could therefore provide a truly concurrent semantics for all the formalisms which can be modeled within the CHARM framework; however, this goes beyond the scope  ...  The major changes with respect to [6] are some new results in Section 3, a more formal treatment of the modeling of graph grammars and cc programs in Sections 4 and 5, respectively, and a new section  ... 
doi:10.1016/0304-3975(94)90206-2 fatcat:we6k6jbfsrchbeynrel3bf3g4y

Encoding Distributed Process Calculi into LMNtal

Kazunori Ueda
2008 Electronical Notes in Theoretical Computer Science  
Towards a unifying model of concurrency, we have designed and implemented LMNtal (pronounced "elemental"), a model and language based on hierarchical graph rewriting that uses logical variables to represent  ...  We have designed and implemented a self-adjusting management technique of names in which the name management and mobility operations are performed concurrently.  ...  The author would like to thank the current and former members of the LMNtal development team who jointly built our publicly available LMNtal implementation.  ... 
doi:10.1016/j.entcs.2008.04.012 fatcat:xe3pbndxtvakfkcbc4l3tkh2tq

Revisiting Graph Types in HyperLMNtal: A Modeling Language for Hypergraph Rewriting

Alimujiang Yasen, Kazunori Ueda
2021 IEEE Access  
Hypergraphs are a highly expressive data structure for modeling and programming, for which high-level language constructs are yet to be established.  ...  HyperLMNtal is a modeling language based on hypergraph rewriting.  ...  HYPERGRAPH REWRITING AS A MODELING LANGUAGE Graphs and hypergraphs (i.e., graphs that allow edges with multiple endpoints) are highly general and powerful data structures for modeling and programming.  ... 
doi:10.1109/access.2021.3112903 fatcat:mjnccba3yfetjatcxrcjkjedhq

Conditional rewriting logic as a unified model of concurrency

José Meseguer
1992 Theoretical Computer Science  
Rewriting with conditional rewrite rules modulo a set E of structural axioms provides a general framework for unifying a wide variety of models of concurrency.  ...  ., Conditional rewriting logic as a unified model of concurrency, Theoretical Computer Science 96 (1992) 73-155.  ...  The resulting notion of concurrent system specializes to a wide variety of concurrency models in a natural way.  ... 
doi:10.1016/0304-3975(92)90182-f fatcat:sqyjuly6rzambma4e6zmomrogm

Subject index volumes 1–200

1999 Theoretical Computer Science  
eNCE -, 2306 graph L-systems, 496 graph manipulations. 238 concurrency of -, 238 &raph matchings, counting complexity of -, 2021 &raph model, 3452 of A& 3452 Pw 222 graph models, 1797 nonisomorphism  ...  of a Boolean function, 3305 logic programs. 3207 graph rewriting, 1001, 1165, 1363 algebraic -, 2935 language DACTL, 2478 low-level language of -, 1363 graph rewriting system, confluent, 2947  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm

Constraint design rewriting

Roberto Bruni, Alberto Lluch Lafuente, Ugo Montanari
2015 Science of Computer Programming  
We propose an algebraic approach to the design and transformation of constraint networks, inspired by Architectural Design Rewriting.  ...  The approach can be understood as (i) an extension of ADR with constraints, and (ii) an application of ADR to the design of reconfigurable constraint networks.  ...  Restriction (νx)G acts as a binder for x with scope G and similarly L x [G] binds names x with scope G.  ... 
doi:10.1016/j.scico.2013.11.015 fatcat:hdpxatplqncrleettwnljkmb6q

An Algebra of Hierarchical Graphs and its Application to Structural Encoding

R. Bruni, F. Gadducci, A. Lluch Lafuente
2010 Scientific Annals of Computer Science  
Our algebra can be understood as a high-level language for describing graphs with a node-sharing, embedding structure, and it is then well suited for defining graphical representations of software models  ...  In addition, proving soundness and correctness of an encoding (i.e. proving that structurally equivalent processes are mapped to isomorphic graphs) becomes easier as it can be done by induction over the  ...  for rewriting hierarchical graphs.  ... 
doaj:27b278d55a0346fdaea8169a1c7176e6 fatcat:tfiubj7a5nat3dbmq32vvozeha

Book announcements

1991 Discrete Applied Mathematics  
Correctness of a program. Hoare's logic. An equivalence property for correct- ness. Equivalent programs. Approximation of one program by another. Extension to non-deterministic operations.  ...  Decidability results and characterization of strategies for the development of logic programs (A. Pettorossi and M. Proietti). Unfold/fold transformation of stratified programs (H. Seki).  ... 
doi:10.1016/0166-218x(91)90051-w fatcat:oqpbdxzpljcihecb5tgyinpmva

A decentralised graphical implementation of mobile ambients

Fabio Gadducci, Giacoma Valentina Monreale
2011 The Journal of Logic and Algebraic Programming  
., non-hierarchical) graphs and it is sound and complete with respect to the structural congruence of the calculus (i.e., two processes are equivalent iff mapped to isomorphic graphs).  ...  Our solution faithfully captures a basic feature of the calculus (ambients can be nested and reductions are propagated across the nesting) and it allows to model the reduction semantics via a graph transformation  ...  Graph transformation has been used, for example, as a computational model for functional programming languages and for specifying distributed systems and visual languages.  ... 
doi:10.1016/j.jlap.2010.10.002 fatcat:h6qqkvark5fypi4zmhtn4dkcpe

Mapping Fusion and Synchronized Hyperedge Replacement into Logic Programming [article]

Ivan Lanese, Ugo Montanari
2006 arXiv   pre-print
In this paper we compare three different formalisms that can be used in the area of models for distributed, concurrent and mobile systems.  ...  We also present a mapping from HSHR into a transactional version of logic programming and prove that there is a full correspondence between the two formalisms.  ...  For us HSHR is a good step in the direction of logic programming (Lloyd 1993) . We consider logic programming as a formalism for modelling concurrent and distributed systems.  ... 
arXiv:cs/0504050v2 fatcat:dvur3qrpyjbn3cyvs56ehkuxvi

Comparing logics for rewriting: rewriting logic, action calculi and tile logic

Fabio Gadducci, Ugo Montanari
2002 Theoretical Computer Science  
The large di usion of concurrent and distributed systems has spawned in recent years a variety of new formalisms, equipped with features for supporting an easy speciÿcation of such systems.  ...  The overall goal of our work is to ÿnd out a common layout where these logics can be recast, thus allowing for a comparison and an evaluation of their speciÿc features.  ...  Indeed, in [54] Meseguer takes advantage of the correspondence between deductions in rewriting logic and (concurrent) computations, deÿning a model for a rewrite theory as a system whose states are E-equivalence  ... 
doi:10.1016/s0304-3975(01)00362-0 fatcat:kg2dg7fptrgllaeunxvzgqwglq

Name-free combinators for concurrency [article]

Lucius Gregory Meredith, Michael Stay
2019 arXiv   pre-print
We also show that multisorted Lawvere theories enriched over graphs suffice to capture the operational semantics of the calculus.  ...  We modify Yoshida's combinators by replacing "new" and replication with reflective operators to provide the first combinator calculus with no bound names into which the asynchronous pi calculus has a faithful  ...  The symmetric situation holds for black set theory: the element-of predicate cannot see inside red sets.  ... 
arXiv:1703.07054v4 fatcat:go5byifwk5ao5kttmuers4orra
« Previous Showing results 1 — 15 out of 600 results