Skip to main content

A Simulation Preorder for Abstraction of Reactive Systems

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2294))

Abstract

We present a simulation preorder for reactive systems modeled by fair Kripke structures whose transition relation is divided into two parts, internal and external. The first one models the internal behaviour of the system, while the second one is used to model the interaction with an environment. We show that our simulation preorder preserves a substantial subset of ∀CTL& *. Then, we present an abstraction technique for systems composed by multiple modules and we show that each such system is smaller in the simulation preorder than its “augmented” components. We illustrate our abstraction methodology by applying it to Petri net reactive systems.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur, Th.A. Henziger: Reactive Modules, in: Proc. of the 11th IEEE Symposium on Logic in Computer Science LICS, 1996, 207–218.

    Google Scholar 

  2. E.M. Clarke, E.A. Emerson: Synthesis of Synchronizations Skeletons for Branching Time Temporal Logic, in: Workshop on Logic of Programs, Yorktown Heights, May 1981, LNCS 131, Springer-Verlag, 1981.

    Google Scholar 

  3. E.M. Clarke, O. Grumberg, D.E. Long: Model Checking and Abstraction, ACM Trans. Prog. Lang. Sys., 16(5), 1994, 1512–1542.

    Article  Google Scholar 

  4. E.M. Clarke, O. Grumberg, D.E. Long: Model Checking, in: Model Checking, Abstraction and Composition, vol 152 of NATO ASI Series F, Springer-Verlag, 1996, 477–498.

    Google Scholar 

  5. J. Esparza, S. Melzer: Model Checking LTL Using Constraint Programming, Technical Report, Technische Universität München, 1997.

    Google Scholar 

  6. O. Grumberg, D.E. Long: Model Checking and Modular Verification, ACM Transactions on Programming Languages and Systems 16, 1994, 843–871 (a short version in Proceedings of CONCUR’91, LNCS 527, 1991, 250-265).

    Google Scholar 

  7. Y. Kersten, A. Pnueli, L. Raviv: Algorithmic Verification of Linear Temporal Logic Specifications, in: Proc. of the 25th International Colloquium on Automata, Languages, and Programming ICALP’98, LNCS 1443, Springer-Verlag, 1998, 1–16.

    Google Scholar 

  8. Y. Kersten, A. Pnueli: Modularization and Abstraction: The Keys to Practical Formal Verification, in: Proc. of the 23rd International Symposium on Mathematical Foundations of Computer Science MFCS’98, LNCS 1450, Springer-Verlag, 1998, 54–71.

    Google Scholar 

  9. O. Kupferman, M.Y. Vardi: Modular Model Checking, in: Proc. of the International Symposium “Compositionality: The Significant Difference” COMPOS’97, Bad Malente (Germany), Sept 8–12, 1997, LNCS 1536, Springer-Verlag, 1998, 381–401.

    Google Scholar 

  10. B. Kurshan: Analysis of Discrete Event Coordination, in: Proc. of the REX Workshop on Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness (J.W. Bakker, W.-P. de Roever, G. Rozenberg, eds.), LNCS 430, Springer-Verlag, 1989, 414–453.

    Google Scholar 

  11. Z. Manna, A. Pnueli: The Temporal Logic of Reactive and Concurrent Systems. Specification, Springer-Verlag, 1992.

    Google Scholar 

  12. W. Reisig: Petri Nets, Springer-Verlag, 1985.

    Google Scholar 

  13. W. Reisig: Elements of Distributed Algorithms. Modeling and Analysis with Petri Nets, Springer-Verlag, 1998.

    Google Scholar 

  14. F.L. Tiplea, A. Tiplea: Petri Net Reactive Modules, Tech. Report 1999-7, Universität Augsburg, Institut für Informatik, 1999, 50pp.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

TŢiplea, F.L., TŢiplea, A. (2002). A Simulation Preorder for Abstraction of Reactive Systems. In: Cortesi, A. (eds) Verification, Model Checking, and Abstract Interpretation. VMCAI 2002. Lecture Notes in Computer Science, vol 2294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47813-2_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-47813-2_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43631-7

  • Online ISBN: 978-3-540-47813-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics