Skip to main content

Largest Finite Satisfying Region

  • Chapter
  • First Online:
Formal Methods for Discrete-Time Dynamical Systems

Part of the book series: Studies in Systems, Decision and Control ((SSDC,volume 89))

  • 2178 Accesses

Abstract

In this chapter, we focus on the problem of analyzing a finite transition system with the goal of partitioning its state space into satisfying and non-satisfying subsets of states. Since the focus is on analysis, we consider transition systems with no inputs.

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

Access this chapter

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

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Calin Belta .

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Belta, C., Yordanov, B., Aydin Gol, E. (2017). Largest Finite Satisfying Region. In: Formal Methods for Discrete-Time Dynamical Systems. Studies in Systems, Decision and Control, vol 89. Springer, Cham. https://doi.org/10.1007/978-3-319-50763-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-50763-7_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-50762-0

  • Online ISBN: 978-3-319-50763-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics