Partial Order Reductions for Timed Systems

@inproceedings{Bengtsson1998PartialOR,
  title={Partial Order Reductions for Timed Systems},
  author={Johan Bengtsson and Bengt Jonsson and Johan Lilius and Wang Yi},
  booktitle={CONCUR},
  year={1998}
}
In this paper, we present a partial-order reduction method for timed systems based on a local-time semantics for networks of timed automata. The main idea is to remove the implicit clock synchronization between processes in a network by letting local clocks in each process advance independently of clocks in other processes, and by requiring that two processes resynchronize their local time scales whenever they communicate. A symbolic version of this new semantics is developed in terms of… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 113 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 19 references

An improvement in formal veri cation

Kim G. Larsen, Paul Pettersson, Wang Yi.
Proc . FORTE ' • 1996

Henzinger and PeiHsin Ho . HyTech : The Cornell HYbridTECHnology Tool

D. A. Peled
1995

E  cient veri cation of parallel realtimesystems

Tomohiro Yoneda
Journal of Formal Methods in System Design • 1993

On - they veri cation with stubborn sets

Wang Yi, Paul Pettersson, Mats Daniels.
1993

Similar Papers

Loading similar papers…