Sciweavers

TACAS
1998
Springer
81views Algorithms» more  TACAS 1998»
14 years 3 months ago
Formal Design and Analysis of a Gear Controller
In this paper, we report on an application of the validation and veri cation tool kit Uppaal in the design and analysis of a prototype gear controller, carried out in a joint proje...
Magnus Lindahl, Paul Pettersson, Wang Yi
TACAS
1998
Springer
105views Algorithms» more  TACAS 1998»
14 years 3 months ago
Verification of Large State/Event Systems Using Compositionality and Dependency Analysis
A state/event model is a concurrent version of Mealy machines used for describing embedded reactive systems. This paper introduces a technique that uses compositionality and depend...
Jørn Lind-Nielsen, Henrik Reif Andersen, Ge...
TACAS
1998
Springer
115views Algorithms» more  TACAS 1998»
14 years 3 months ago
MESA: Support for Scenario-Based Design of Concurrent Systems
The latest ITU-T standard syntax of Message Sequence Charts (MSCs) 16] o ers several operators to compose MSCs in a hierarchical, iterating, and nondeterministic way. However, curr...
Hanêne Ben-Abdallah, Stefan Leue
TACAS
1998
Springer
95views Algorithms» more  TACAS 1998»
14 years 3 months ago
Symbolic Exploration of transition Hierarchies
Rajeev Alur, Thomas A. Henzinger, Sriram K. Rajama...
TACAS
1998
Springer
131views Algorithms» more  TACAS 1998»
14 years 3 months ago
Detecting Races in Relay Ladder Logic Programs
Relay Ladder Logic (RLL) [4] is a programming language widely used for complex embedded control applications such as manufacturing and amusement park rides. The cost of bugs in RLL...
Alexander Aiken, Manuel Fähndrich, Zhendong S...
TACAS
1998
Springer
103views Algorithms» more  TACAS 1998»
14 years 3 months ago
Model Checking via Reachability Testing for Timed Automata
Luca Aceto, Augusto Burgueño, Kim Guldstran...
SWAT
1998
Springer
77views Algorithms» more  SWAT 1998»
14 years 3 months ago
Optimal Deterministic Protocols for Mobile Robots on a Grid
Roberto Grossi, Andrea Pietracaprina, Geppino Pucc...
SWAT
1998
Springer
84views Algorithms» more  SWAT 1998»
14 years 3 months ago
Models and Motion Planning
We study the complexity of the motion planning problem for a bounded-reach robot in the situation where the n obstacles in its workspace satisfy two of the realistic models propos...
Mark de Berg, Matthew J. Katz, Mark H. Overmars, A...
SWAT
1998
Springer
108views Algorithms» more  SWAT 1998»
14 years 3 months ago
Formal Language Constrained Path Problems
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
Christopher L. Barrett, Riko Jacob, Madhav V. Mara...