OpenAlex
PricingAboutJobs
Log inGet started
Work

Minimum-Cost Reachability for Priced Time Automata

HTML

Year: 2001
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Hybrid Systems: Computation and Control
DOI: 10.1007/3-540-45351-2_15
Authors: Gerd Behrmann, Ansgar Fehnker, Thomas Hune, Kim Larsen, Paul Pettersson, Judi Romijn, Frits Vaandrager
Institutions: Aalborg University, Radboud University Nijmegen, Aarhus University, Uppsala University
Language: English

Topic: Formal Methods in Verification
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: priced timed automata, timed automata, branch and bound, decidability

Open Access status: closed
OpenAlex ID: W2065323166
FWCI: 5.717
Cites: 28
Cited by: 329
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms