research-article

Event order abstraction for parametric real-time system verification

Author:

Shinya UmenoAuthors Info & Claims

EMSOFT '08: Proceedings of the 8th ACM international conference on Embedded software

Pages 1 - 10

https://doi.org/10.1145/1450058.1450060

Published: 19 October 2008 Publication History

Abstract

We present a new abstraction technique, event order abstraction} (EOA), for parametric safety verification of real-time systems in which "correct orderings of events" needed for system correctness are maintained by timing constraints on the systems' behavior. By using EOA, one can separate the task of verifying a real-time system into two parts: 1. Safety property verification of the system given that only correct event orderings occur; and 2. Derivation of timing parameter constraints for correct orderings of events in the system.

The user first identifies a candidate set of bad event orders. Then, by using ordinary untimed model-checking, the user examines whether a discretized system model in which all timing constraints are abstracted away satisfies a desirable safety property under the assumption that the identified bad event orders occur in no system execution. The user uses counterexamples obtained from the model-checker to identify additional bad event orders, and repeats the process until the model-checking succeeds. In this step, the user obtains a sufficient set of bad event orders that must be excluded by timing synthesis for system correctness.

Next, the algorithm presented in the paper automatically derives a set of timing parameter constraints under which the system does not exhibit the identified bad event orderings. From this step combined with the untimed model-checking step, the user obtains a sufficient set of timing parameter constraints under which the system executes correctly with respect to a given safety property.

We illustrate the use of EOA with a train-gate example inspired by the general railroad crossing problem [13]. We also summarize three other case studies, a biphase mark protocol, the IEEE 1394 root contention protocol, and the Fischer mutual exclusion algorithm.

References

[1]

R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183--235, 1994.

Digital Library

[2]

R. Alur, T. A. Henzinger, and M. Y. Vardi. Parametric real-time reasoning. In ACM Symposium on Theory of Computing, pages 592--601, 1993.

Digital Library

[3]

A. Annichini, A. Bouajjani, and M. Sighireanu. TReX: A tool for reachability analysis of complex systems. In Computer Aided Verification, pages 368--372, 2001.

Digital Library

[4]

E. Asarin, O. Maler, and A. Pnueli. On discretization of delays in timed automata and digital circuits. In Proc. of CONCUR'98, volume 1466 of Lecture Notes in Computer Science, pages 470--484, Nice, France, 1998. Springer.

Digital Library

[5]

D. Bosnacki. Digitization of timed automata. In Proc. of FMICS 99, 1999.

[6]

H. Bowman, G. Faconti, J.-P. Katoen, D. Latella, and M. Massink. Automatic verification of a lip-synchronisation protocol using uppaal. Formal Aspects of Computing, 10(5-6):550--575, 1998.

[7]

E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In CAV 2000, volume 1855 of Lecture Notes in Computer Science, pages 154--169. Springer, 2000.

Digital Library

[8]

S. R. Dalal, A. Jain, N. Karunanithi, J. M. Leaton, C. M. Lott, G. C. Patton, and B. M. Horowitz. Model-based testing in practice. In International Conference on Software Engineering, pages 285--294, 1999.

Digital Library

[9]

L. M. de Moura, S. Owre, H. Rueß, J. M. Rushby, N. Shankar, M. Sorea, and A. Tiwari. SAL 2. In Proc. of CAV 2004, volume 3114 of Lecture Notes in Computer Science, pages 496--500. Springer, 2004.

[10]

J. Dick and A. Faivre. Automating the generation and sequencing of test cases from model-based specifications. In FME '93: Proceedings of the First International Symposium of Formal Methods Europe on Industrial-Strength Formal Methods, pages 268--284, London, UK, 1993. Springer-Verlag.

Digital Library

[11]

G. Frehse, S. K. Jha, and B. H. Krogh. A counterexample-guided approach to parameter synthesis for linear hybrid automata. In HSCC 2008, volume 4981 of Lecture Notes in Computer Science, pages 187--200. Springer, 2008.

Digital Library

[12]

K. Havelund, A. Skou, K. Larsen, and K. Lund. Formal modeling and analysis of an audio/video protocol: an industrial case study using uppaal. In RTSS '97: Proceedings >of the 18th IEEE Real-Time Systems Symposium (RTSS '97), page 2, Washington, DC, USA, 1997. IEEE Computer Society.

Digital Library

[13]

C. Heitmeyer and N. Lynch. The generalized railroad crossing: A case study in formal verification of real-time systems. Technical Report MIT/LCS/TM-511, MIT, 1994.

Digital Library

[14]

T. Henzinger, J. Preussig, and H. Wong-Toi. Some lessons from the HYTECH experience. In Proc. of the 40th Annual Conference on Decision and Control, pages 2887--2892. IEEE Computer Society Press, 2001.

[15]

T. A. Henzinger. The theory of hybrid automata. In LICS '96: Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science, page 278, Washington, DC, USA, 1996. IEEE Computer Society.

Digital Library

[16]

T. A. Henzinger, Z. Manna, and A. Pnueli. Timed transition systems. In REX workshop Real-Time: Theory in Practice, volume 600 of Lecture Notes in Computer Science, pages 226--251. Springer-Verlag, 1992.

Digital Library

[17]

T. A. Henzinger, Z. Manna, and A. Pnueli. What good are digital clocks? In Proc. of ICALP 1992, volume 623 of Lecture Notes in Computer Science, pages 545--558. Springer, 1992.

Digital Library

[18]

T. Hune, J. Romijn, M. Stoelinga, and F. W. Vaandrager. Linear parametric model checking of timed automata. In Tools and Algorithms for Construction and Analysis of Systems, pages 189--203, 2001.

Digital Library

[19]

D. K. Kaynar, N. Lynch, R. Segala, and F. Vaandrager. The Theory of Timed I/O Automata. Synthesis Lectures on Computer Science. Morgan & Claypool Publishers, 2006.

Digital Library

[20]

K. G. Larsen, P. Pettersson, and W. Yi. UPPAAL in a nutshell. International Journal on Software Tools for Technology Transfer, 1(1-2):134--152, 1997.

Digital Library

[21]

N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers Inc., 1996.

Digital Library

[22]

O. Maler and S. Yovine. Hardware timing verification using kronos. iccsse, 00:23, 1996.

Digital Library

[23]

Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurent Systems: Specification. Springer-Verlag, 1993.

Digital Library

[24]

M. Merritt, F. Modugno, and M. R. Tuttle. Time-constrained automata (extended abstract). In Proc. of CONCUR 1991, volume 527 of Lecture Notes in Computer Science, pages 408--423. Springer, 1991.

Digital Library

[25]

J. S. Moore. A formal model of asynchronous communication and its use in mechanically verifying a biphase mark protocol. Formal Aspects of Computing, 6(1):60--91, 1994.

[26]

J. Ouaknine and J. Worrell. Revisiting digitization, robustness, and decidability for timed automata. In Proc. of the 18th IEEE Symposium on Logic in Computer Science (LICS'03), pages 198--207, 2003.

Digital Library

[27]

D. P. L. Simons and M. Stoelinga. Mechanical verification of the IEEE 1394a root contention protocol using Uppaal2k. International Journal on Software Tools for Technology Transfer, 3(4):469--485, 2001.

[28]

R. Spelberg and W. Toetenel. Parametric real-time model checking using splitting trees. Nordic Journal of Computing, 8:88--120, 2001.

Digital Library

[29]

S. Umeno. Parametrically verifying embedded real-time protocols using event order abstraction. Technical report, Massachusetts Institute of Technology. To appear. (A conference version has been submitted for publication).

[30]

S. Umeno. Event order abstraction for parametric real-time system verification. Technical Report MIT-CSAIL-TR-2008-048, Massachusetts Institute of Technology, July 2008.

[31]

F. W. Vaandrager and A. de Groot. Analysis of a biphase mark protocol with UPPAAL and PVS. Formal Asp. Comput., 18(4):433--458, 2006.

[32]

F. Wang. Symbolic parametric safety analysis of linear hybrid systems with BDD-like data-structures. Transactions on Software Engineering, 31:38--51, 2005.

Digital Library

[33]

S. Yovine. KRONOS: a verification tool for real-time systems. International Journal on Software Tools for Technology Transfer (STTT), 1(1-2):123--133, 1997.

[34]

D. Zhang and R. Cleaveland. Fast on-the-fly parametric real-time model checking. In Proceedings of the 26th IEEE Real-Time Systems Symposium, pages 157--166, 2005.

Digital Library

Cited By

Bu LCimatti ALi XMover STonetta S(2010)Model checking of hybrid systems using shallow synchronizationProceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems10.1007/978-3-642-13464-7_13(155-169)Online publication date: 7-Jun-2010
https://dl.acm.org/doi/10.1007/978-3-642-13464-7_13
Heidarian FSchmaltz JVaandrager F(2009)Analysis of a Clock Synchronization Protocol for Wireless Sensor NetworksProceedings of the 2nd World Congress on Formal Methods10.1007/978-3-642-05089-3_33(516-531)Online publication date: 4-Nov-2009
https://dl.acm.org/doi/10.1007/978-3-642-05089-3_33
Umeno S(2009)Machine-Assisted Parameter Synthesis of the Biphase Mark Protocol Using Event Order AbstractionProceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems10.1007/978-3-642-04368-0_20(258-274)Online publication date: 3-Sep-2009
https://dl.acm.org/doi/10.1007/978-3-642-04368-0_20

Index Terms

Event order abstraction for parametric real-time system verification

Recommendations

Lazy Abstraction for Higher-Order Program Verification
PPDP '18: Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming

This paper proposes a lazy abstraction algorithm for verification of functional programs. The feature of the lazy abstraction method is that the predicate abstraction and the model checking are fused, and that abstractions for unreachable configurations ...
Verification by Augmented Finitary Abstraction

The paper deals with the proof method of verification by finitary abstraction (VFA), which presents a feasible approach to the verification of the temporal properties of (potentially infinite-state) reactive systems. The method consists of a two-step ...
SAT-based Abstraction Refinement for Real-time Systems

In this paper, we present an abstraction refinement approach for model checking safety properties of real-time systems using SAT-solving. We present a faithful embedding of bounded model checking for systems of timed automata into propositional logic ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

EMSOFT '08: Proceedings of the 8th ACM international conference on Embedded software

October 2008

284 pages

ISBN:9781605584683

DOI:10.1145/1450058

Program Chairs:
Luca de Alfaro
University of California, Santa Cruz
,
Jens Palsberg
University of California, Los Angeles

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 October 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ESWEEK 08

Sponsor:

ESWEEK 08: Fourth Embedded Systems Week

October 19 - 24, 2008

GA, Atlanta, USA

Acceptance Rates

Overall Acceptance Rate 60 of 203 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
182
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 27 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Bu LCimatti ALi XMover STonetta S(2010)Model checking of hybrid systems using shallow synchronizationProceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems10.1007/978-3-642-13464-7_13(155-169)Online publication date: 7-Jun-2010
https://dl.acm.org/doi/10.1007/978-3-642-13464-7_13
Heidarian FSchmaltz JVaandrager F(2009)Analysis of a Clock Synchronization Protocol for Wireless Sensor NetworksProceedings of the 2nd World Congress on Formal Methods10.1007/978-3-642-05089-3_33(516-531)Online publication date: 4-Nov-2009
https://dl.acm.org/doi/10.1007/978-3-642-05089-3_33
Umeno S(2009)Machine-Assisted Parameter Synthesis of the Biphase Mark Protocol Using Event Order AbstractionProceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems10.1007/978-3-642-04368-0_20(258-274)Online publication date: 3-Sep-2009
https://dl.acm.org/doi/10.1007/978-3-642-04368-0_20

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten