WFRF:(Lin Yi)
Search: WFRF:(Lin Yi) > (2000-2004) > A Complete Axiomati...
- 4 of 7
- Previous record
- Next record
- To hitlist
A Complete Axiomatisation for Timed Automata
- Lin, Huimin (author)
-
- Yi, Wang (author)
- Uppsala universitet,Institutionen för informationsteknologi
- (creator_code:org_t)
- Department of Information Technology, Uppsala University, 2000
- English.
- Series: Technical report / Department of Information Technology, Uppsala University, 1404-3203 ; 2000-025
- Reports (other academic/artistic)
Abstract
Subject headings
Close
- Timed automata has been recognised as a fundamental model for real time systems, but it still lacks a satisfactory algebraic theory. This paper fills the gape by presenting a complete proof system for timed automata, in which the equalities between pairs of timed automata that are timed bisimilar can be derived. The proof of the completeness result relies on the introduction of the notion of symbolic timed bisimulation.
Publication and Content Type
- vet (subject category)
- rap (subject category)
To the university's database
- 4 of 7
- Previous record
- Next record
- To hitlist
Find more in SwePub
- By the author/editor
- Lin, Huimin
- Yi, Wang
- Parts in the series
- Technical report ...
- By the university
- Uppsala University
Search outside SwePub
- Extend your search to:
- Google Book Search
- Google Scholar
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.
- Copyright © LIBRIS - National Library Systems
- LIBRIS.kb.se
