Constraint Nets have been developed as an algebraic on-line computational model of robotic systems. Timed forall-automata have been studied as a logical specification language of real-time behaviors. A general verification method has been proposed for checking whether a constraint net model satisfies a timed forall-automaton specification. In this paper, we illustrate constraint net modeling and timed forall-automata analysis using an elevator example. We start with a description of the functions and user interfaces of a simple elevator system, and then model the complete system in Constraint Nets. The analysis of a well-designed elevator system should guarantee that any request will be served within some bounded time. We specify such requirements in timed forall-automata, and show that the constraint net model of the elevator system satisfies the timed forall-automaton specification.
[1]
Alan K. Mackworth,et al.
Will The Robot Do The Right Thing
,
1992
.
[2]
Ian Foster,et al.
Strand: New Concepts in Parallel Programming
,
1990
.
[3]
Peter E. Caines,et al.
The logical control of an elevator
,
1995,
IEEE Trans. Autom. Control..
[4]
Yoav Shoham,et al.
Agent-Oriented Programming
,
1992,
Artif. Intell..
[5]
Pierre Wolper.
Temporal Logic Can Be More Expressive
,
1983,
Inf. Control..
[6]
Bo Ingvar Sandén,et al.
An entity-life modeling approach to the design of concurrent software
,
1989,
Commun. ACM.
[7]
Roger Hale,et al.
Using Temporal Logic for Prototyping: The Design of a Lift Controller
,
1987,
Temporal Logic in Specification.