Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

Verification for Timed Automata extended with Unbounded Discrete Data Structures

Saved in:
Bibliographic Details
Published in:Logical Methods in Computer Science
Format: Online Article RSS Article
Published: 2015
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1864030186898456580
collection WordPress RSS
FRELIP Feed Integration
container_title Logical Methods in Computer Science
description
discipline_display Engineering & Technology
discipline_facet Engineering & Technology
format Online Article
RSS Article
genre Journal Article
id rss_article:6137
institution FRELIP
journal_source_facet Logical Methods in Computer Science
publishDate 2015
publishDateSort 2015
record_format rss_article
spellingShingle Verification for Timed Automata extended with Unbounded Discrete Data Structures
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
sub_discipline_display Computer Science & IT
sub_discipline_facet Computer Science & IT
subject_display Computer Science & Information Science
Computer Science & IT
Engineering & Technology
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
subject_facet Computer Science & Information Science
Computer Science & IT
Engineering & Technology
title Verification for Timed Automata extended with Unbounded Discrete Data Structures
title_auth Verification for Timed Automata extended with Unbounded Discrete Data Structures
title_full Verification for Timed Automata extended with Unbounded Discrete Data Structures
title_fullStr Verification for Timed Automata extended with Unbounded Discrete Data Structures
title_full_unstemmed Verification for Timed Automata extended with Unbounded Discrete Data Structures
title_short Verification for Timed Automata extended with Unbounded Discrete Data Structures
title_sort verification for timed automata extended with unbounded discrete data structures
topic Computer Science & Information Science
Computer Science & IT
Engineering & Technology
url https://doi.org/10.2168/LMCS-11(3:20)2015