Verification of duration systems using an approximation approach

Authors:
Riadh Robbana
Affiliations:
LIP2 Laboratory, Ecole Polytechnique de Tunisie, rue Elkhawarizmi, 2070 La Marsa, Tunisia
Venue:
Journal of Computer Science and Technology
Year:
2003

Citing 14
Cited 1

The algorithmic analysis of hybrid systems

Theoretical Computer Science - Special issue on hybrid systems
What's decidable about hybrid automata?

Journal of Computer and System Sciences
Decidable integration graphs

Information and Computation
What Good Are Digital Clocks?

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Preemptive Job-Shop Scheduling Using Stopwatch Automata

TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems

Hybrid Systems
On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures

Hybrid Systems II
Liveness and Acceleration in Parameterized Verification

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Regular Model Checking

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Decidability of Bisimulation Equivalences for Parallel Timer Processes

CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Verification of Context-Free Timed Systems Using Linear Hybrid Observers

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Verifying omega-Regular Properties for a Subclass of Linear Hybrid Systems

Proceedings of the 7th International Conference on Computer Aided Verification
From Duration Calculus To Linear Hybrid Automata

Proceedings of the 7th International Conference on Computer Aided Verification
An Approach to the Description and Analysis of Hybrid Systems

Hybrid Systems

Test generation for duration systems

VECoS'07 Proceedings of the First international conference on Verification and Evaluation of Computer and Communication Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Internet routing is achieved by a set of nodes running distributed algorithms-routing protocols. However, many nodes are resistless to wrong messages or improper operations, unable to detect or correct them. Thus a wrong message or an improper operation ...