Skip to main content
SpringerLink
Log in

Prom timed graphs to hybrid automata

Abstract

  • Conference paper
  • First Online:
CONCUR '94: Concurrency Theory

Part of the book series: Lecture Notes in Computer Science ((volume 836))

  • 19 Accesses

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

Access this chapter

Log in via an institution
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

Institutional subscriptions

Author information

Authors and Affiliations

  1. Institute of Computer Science, FORTH and University of Crete, Greece

    Costas Courcoubetis

Authors
  1. Costas Courcoubetis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bengt Jonsson Joachim Parrow

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag

About this paper

Cite this paper

Courcoubetis, C. (1994). Prom timed graphs to hybrid automata. In: Jonsson, B., Parrow, J. (eds) CONCUR '94: Concurrency Theory. Lecture Notes in Computer Science, vol 836. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015006

Download citation

  • DOI: https://doi.org/10.1007/BFb0015006

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58329-5

  • Online ISBN: 978-3-540-48654-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation