Skip to main content

Exact system relationships

  • Chapter
  • First Online:
Verification and Control of Hybrid Systems
  • 2314 Accesses

Abstract

The verification problem for a system S a and a model of desired behavior S b , asks the fundamental question of whether S a is either equivalent to the desired system \((S_a \cong S_b)\) or contained in the desired system \((S_a \preceq S_b)\). The answer to such questions will always depend on what we mean by system equivalence and system containment. In this chapter, we give various precise de_nitions for such relationships between two systems.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 139.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Paulo Tabuada .

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag US

About this chapter

Cite this chapter

Tabuada, P. (2009). Exact system relationships. In: Verification and Control of Hybrid Systems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-0224-5_4

Download citation

Publish with us

Policies and ethics