Sciweavers

276 search results - page 12 / 56
» Representing Transition Systems by Logic Programs
Sort
View
FORTE
2008
15 years 1 months ago
An SMT Approach to Bounded Reachability Analysis of Model Programs
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
Margus Veanes, Nikolaj Bjørner, Alexander R...
ICTAC
2005
Springer
15 years 5 months ago
A Rewriting Logic Sampler
Rewriting logic is a simple computational logic very well suited as a semantic framework within which many different models of computation, systems and languages can be naturally ...
José Meseguer
EUSFLAT
2003
15 years 1 months ago
Modelling with temporal fuzzy chains
The aim of this paper is to present the Temporal Fuzzy Chains (TFCs) [3] to model the dynamic systems in a linguistic manner. TFCs make use of two different concepts: the traditio...
Juan Moreno García, Luis Jiménez, Jo...
COMPASS
1994
15 years 3 months ago
Equations for Describing Dynamic Nets of Communicating Systems
We give a notation and a logical calculus for the description and deductive manipulation of dynamic networks of communicating components. We represent such nets by hierarchical sys...
Manfred Broy
AIIA
1995
Springer
15 years 3 months ago
Learning Programs in Different Paradigms using Genetic Programming
Genetic Programming (GP) is a method of automatically inducing programs by representing them as parse trees. In theory, programs in any computer languages can be translated to par...
Man Leung Wong, Kwong-Sak Leung