Sciweavers

323 search results - page 1 / 65
» Synthesis for Structure Rewriting Systems
Sort
View
MFCS
2009
Springer
14 years 1 months ago
Synthesis for Structure Rewriting Systems
Abstract. The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in w...
Lukasz Kaiser
WFLP
2009
Springer
277views Algorithms» more  WFLP 2009»
14 years 1 months ago
Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
Stephan Falke, Deepak Kapur
CSL
2007
Springer
13 years 10 months ago
Comparing the Expressive Power of Well-Structured Transition Systems
We compare the expressive power of a class of well-structured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewr...
Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van...
ACL
1989
13 years 8 months ago
A Transfer Model Using a Typed Feature Structure Rewriting System with Inheritance
We propose a model for transfer in machine translation which uses a rewriting system for typed feature structures. The grammar definitions describe transfer relations which are ap...
Rémi Zajac