Sciweavers

3353 search results - page 280 / 671
» Laver and set theory
Sort
View
FSTTCS
1993
Springer
15 years 10 months ago
Higher-Order and Semantic Unification
Abstract. We provide a complete system of transformation rules for semantic unification with respect to theories defined by convergent rewrite systems. We show that this standard u...
Nachum Dershowitz, Subrata Mitra
ACSD
2007
IEEE
140views Hardware» more  ACSD 2007»
15 years 10 months ago
Synthesis of Petri Nets from Finite Partial Languages
In this paper we present two algorithms that effectively synthesize a finite place/transition Petri net (p/t-net) from a finite set of labeled partial orders (a finite partial lang...
Robert Lorenz, Robin Bergenthum, Jörg Desel, ...
CIE
2007
Springer
15 years 10 months ago
Effective Computation for Nonlinear Systems
Nonlinear dynamical and control systems are an important source of applications for theories of computation over the the real numbers, since these systems are usually to complicate...
Pieter Collins
RTA
2010
Springer
15 years 10 months ago
Order-Sorted Unification with Regular Expression Sorts
Abstract. We extend first-order order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The set of basic sorts is ...
Temur Kutsia, Mircea Marin
ACSD
2004
IEEE
160views Hardware» more  ACSD 2004»
15 years 10 months ago
Concurrency in Synchronous Systems
In this paper we introduce the notion of weak endochrony, which extends to a synchronous setting the classical theory of Mazurkiewicz traces. The notion is useful in the synthesis ...
Dumitru Potop-Butucaru, Benoît Caillaud, Alb...