Sciweavers

4047 search results - page 367 / 810
» Algebraic Model Checking
Sort
View
PARLE
1987
15 years 10 months ago
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
IADIS
2004
15 years 8 months ago
A CSP based ontology for a smart home
This paper addresses the problem of establishing collaboration between devices in a home environment, even when no previous knowledge is known or stored on the devices. It focuses...
José Ignacio Rendo Fernández, Iain W...
CORR
2008
Springer
77views Education» more  CORR 2008»
15 years 6 months ago
Programming an interpreter using molecular dynamics
PGA (ProGram Algebra) is an algebra of programs which concerns programs in their simplest form: sequences of instructions. Molecular dynamics is a simple model of computation deve...
Jan A. Bergstra, C. A. Middelburg
CVGIP
2002
174views more  CVGIP 2002»
15 years 6 months ago
Computing quadric surface intersections based on an analysis of plane cubic curves
Computing the intersection curve of two quadrics is a fundamental problem in computer graphics and solid modeling. We present an algebraic method for classifying and parameterizin...
Wenping Wang, Barry Joe, Ronald N. Goldman
166
Voted
RML
2002
99views Business» more  RML 2002»
15 years 6 months ago
A System for Querying and Viewing Business Constraints
In E-commerce processes, various rules and constraints regarding product specifications, pricing, terms and conditions are exchanged between vendors and buyers. Developing a forma...
Mizuho Iwaihara, Masayuki Kozawa, Jun Narazaki, Ya...