Results 11  20
of
30
From DataFlow Task to Multitasking: Applying the Synchronous Approach to Active Vision in Robotics
 IEEE TRANS. ON CONTROL SYSTEMS TECHNOLOGY
, 1997
"... In this paper, we apply the synchronous approach to real time active visual threedimensional (3D) reconstruction using a camera mounted on a robot endeffector. It illustrates the adequateness of SIGNAL, a synchronous data flow programming language and environment, for the specification of a syste ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
In this paper, we apply the synchronous approach to real time active visual threedimensional (3D) reconstruction using a camera mounted on a robot endeffector. It illustrates the adequateness of SIGNAL, a synchronous data flow programming language and environment, for the specification of a system dealing with various domains in control theory and computer vision. More precisely, our application consists in the 3D structure estimation of a set of geometrical primitives using an active vision paradigm. At the level of camera motion control, the visual servoing approach is specified and implemented in SIGNAL as a function from sensor inputs to control outputs. Furthermore, the 3D structure estimation method is based on the "structure from controlled motion" approach (constraining camera motion for optimal estimation). Its specification is made in parallel to visual servoing, and involves the delay mechanism of SIGNAL for the specification of filters. This reconstruction involves to be...
Composing objectoriented specifications and verifications with cTLA
 IN WORKSHOP ON SEMANTICS OF OBJECTS AS PROCESSES (SOAP'99), BRICS NOTES SERIES NS992
, 1999
"... In order to support formally correctness preserving refinement steps of objectoriented system designs, we refer at one hand to the practically wellaccepted Unified Modelling Language (UML) and at the other hand to L. Lamport's Temporal Logic of Actions (TLA) which supports concise and preci ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
In order to support formally correctness preserving refinement steps of objectoriented system designs, we refer at one hand to the practically wellaccepted Unified Modelling Language (UML) and at the other hand to L. Lamport's Temporal Logic of Actions (TLA) which supports concise and precise notions of properties of dynamic behaviours and corresponding proof techniques. We apply cTLA which is an extension of TLA and supports the modular definition of process types. Moreover, in cTLA process composition has the character of superposition which facilitates the modular transformation of UML diagrams to corresponding formal cTLA process system definitions and their structured verification. We exemplify transformation and formal verification. Moreover we outline the application of this method for the establishment of domainspecific specification frameworks which can directly support the UMLbased correct design of OOsystems.
A Domain for Concurrent Termination: A Generalization of Mazurkiewicz traces
 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming (ICALP'95), Szeged (Hungary) 1995, number 944 in Lecture Notes in Computer Science
, 1994
"... This paper generalizes the concept of Mazurkiewicz traces to a fuzzy description of a concurrent process, where a known prefix is given in a first component and a second alphabetic component yields necessary information about future actions. This allows to define a good semantic domain where the ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper generalizes the concept of Mazurkiewicz traces to a fuzzy description of a concurrent process, where a known prefix is given in a first component and a second alphabetic component yields necessary information about future actions. This allows to define a good semantic domain where the concatenation is continuous with respect to the Scott and to the Lawson topology. For this we define the notion of ff\Gamma and of ffi trace. We show various mathematical results proving thereby the soundness of our approach. Our theory is a proper generalization of the theory of finite and infinite words (with explicit termination) and of the theory of finite and infinite (real and complex) traces. We make use of trace theory, domain theory, and topology. 1 Introduction The theory of Mazurkiewicz traces has been recognized as an important tool for investigating concurrent systems, overviews are in [Maz87, AR88, Per89, Die90, DR95]. The underlying idea is that for a given alphabet...
The Book Review Column
"... Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics by Juraj Hromkovic. Reviewed by Hassan Masum. This book examines a variety of practical ways to solve NPcomplete problems in practice. 3. Modal and Temporal Properties of Processes by Colin Stirling. Review by ..."
Abstract
 Add to MetaCart
Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics by Juraj Hromkovic. Reviewed by Hassan Masum. This book examines a variety of practical ways to solve NPcomplete problems in practice. 3. Modal and Temporal Properties of Processes by Colin Stirling. Review by Vicky Weissman. This book is about modelling a process by modal logics. It is a good introduction to process algebras. 4. Modal Logic by Patrick Blackburn, Maarten de Rijke, and Yde Venema. Reviewd by P. Daniel Hestand. This book is a comprehensive treatement of Modal logic. It includes Completeness theorems and also a discussion of the complexity of some of the problems in the field. Books I want Reviewed If you want a FREE copy of one of these books in exchange for a review, then email me at gasarchcs.umd.edu Reviews need to be in LaTeX, LaTeX2e, or Plaintext. Books on Algorithms, Combinatorics, and Related Fields 1. Genomic Perl: From Bioinformatics Basics to Working Code by Rex Dw
LRN/RMAUDE BASED APPROACH FOR MODELING AND SIMULATION OF MOBILE CODE SYSTEMS
"... Code mobility technologies attract more and more developers and consumers. Numerous domains are concerned, many platforms are developed and interest applications are realized. However, developing good software products requires modeling, analyzing and proving steps. The choice of models and modeling ..."
Abstract
 Add to MetaCart
(Show Context)
Code mobility technologies attract more and more developers and consumers. Numerous domains are concerned, many platforms are developed and interest applications are realized. However, developing good software products requires modeling, analyzing and proving steps. The choice of models and modeling languages is so critical on these steps. Formal tools are powerful in analyzing and proving steps. However, poorness of classical modeling language to model mobility requires proposition of new models. The objective of this paper is to provide a formal approach based on LRN and RMaude. LRN (Labeled Reconfigurable Nets) is a specific formalism that we propose to model different kinds of code mobility. RMaude (Reconfigurable Maude) is a system that we devlop to encode and simulate LRNmodels.
Coloured Reconfigurable Nets for Code Mobility Modeling
"... Abstract—Code mobility technologies attract more and more developers and consumers. Numerous domains are concerned, many platforms are developed and interest applications are realized. However, developing good software products requires modeling, analyzing and proving steps. The choice of models and ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—Code mobility technologies attract more and more developers and consumers. Numerous domains are concerned, many platforms are developed and interest applications are realized. However, developing good software products requires modeling, analyzing and proving steps. The choice of models and modeling languages is so critical on these steps. Formal tools are powerful in analyzing and proving steps. However, poorness of classical modeling language to model mobility requires proposition of new models. The objective of this paper is to provide a specific formalism “Coloured Reconfigurable Nets ” and to show how this one seems to be adequate to model different kinds of code mobility. Keywords—Code mobility, modeling mobility, labeled reconfigurable nets, Coloured reconfigurable nets, mobile code design paradigms.
Overview of Milner’s work
, 2001
"... The field of theoretical computer science has had a long tradition of providing wonderful edited books to honor various prominent members of the community. The idea behind such edited works is clear: celebrate the work of a particular researcher by having coauthors and colleagues write papers on su ..."
Abstract
 Add to MetaCart
(Show Context)
The field of theoretical computer science has had a long tradition of providing wonderful edited books to honor various prominent members of the community. The idea behind such edited works is clear: celebrate the work of a particular researcher by having coauthors and colleagues write papers on subjects related to the researcher’s body of work. When successful, such a project provides for a wonderful excursion through the work of a researcher, often highlighting an underlying coherence to that work. On that account, the book “Proof, Language, and Interaction: Essays in the Honour of Robin Milner ” (edited by Plotkin, Stirling and Tofte) is a success. In no small part this is due to Milner’s span of work from theory to practice. It is hard to both briefly describe Milner’s contributions and give an idea of the breadth of his effort. Two major tracks of research emerge. First, after some work with John McCarthy’s AI group at Stanford, he developed LCF (specifically, Edinburgh LCF), a system for computerassisted theorem proving based on Dana Scott’s ideas on continuous partial functions for denotational semantics. Not only working on the implementation, Milner also worried about the semantic foundations [1]. LCF came with a programming language, Edinburgh ML, which evolved with Milner’s help into Standard ML, a higherorder language that introduced many features now standard in advanced programming language, features such as polymorphism and type inference [4]. His second track of research involves concurrency. He invented CCS, the calculus of communicating systems [2]. Work on the semantics of CCS went