Sciweavers

30 search results - page 2 / 6
» Towards Modelling Actor-Based Concurrency in Term Rewriting
Sort
View
AMAST
2008
Springer
13 years 7 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...
FUIN
2006
128views more  FUIN 2006»
13 years 5 months ago
A Rewriting Framework for Rule-Based Programming Dynamic Applications
In recent years light-weighted formal methods are of growing interest in construction and analysis of complex concurrent software system. A new rule-action based term rewriting fr...
Anatoly E. Doroshenko, Ruslan Shevchenko
IAJIT
2010
166views more  IAJIT 2010»
13 years 3 months ago
Specification and Prototyping of Reactive Distributed Systems with Algebraic Term Nets
: The specification of the dynamic behaviour of reactive distributed systems must exhibit the structures of control and has to imply explicitly the relevant aspects of the distribu...
Faiza Bouchoul, Mohamed Mostefai
ENTCS
2007
105views more  ENTCS 2007»
13 years 4 months ago
Narrowing and Rewriting Logic: from Foundations to Applications
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
Santiago Escobar, José Meseguer, Prasanna T...
ENTCS
2008
102views more  ENTCS 2008»
13 years 5 months ago
Encoding Distributed Process Calculi into LMNtal
Towards a unifying model of concurrency, we have designed and implemented LMNtal (pronounced "elemental"), a model and language based on hierarchical graph rewriting tha...
Kazunori Ueda