OpenAlex
PricingAboutJobs
Log inGet started
Work

Are Timed Automata Updatable?

HTML

Year: 2000
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Computer Aided Verification: 12th International Conference, CAV 2000, Chicago, IL, USA, July 15-19, 2000. Proceedings
DOI: 10.1007/10722167_35
Authors: Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit
Institutions: École Normale Supérieure Paris-Saclay, Centre National de la Recherche Scientifique
Language: English

Topic: Formal Methods in Verification
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: timed automata, decidability, undecidability, emptiness problem, PSPACE-completeness, clock constraints

Open Access status: green
OpenAlex ID: W1846929317
FWCI: 6.199
Cites: 21
Cited by: 76
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
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security