Full Text Available

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

Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata

Saved in:
Bibliographic Details
Published in:Logical Methods in Computer Science
Format: Online Article RSS Article
Published: 2026
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1867301676650594306
collection WordPress RSS
FRELIP Feed Integration
container_title Logical Methods in Computer Science
description
discipline_display Computer Sciience
discipline_facet Computer Sciience
format Online Article
RSS Article
genre Journal Article
id rss_article:77774
institution FRELIP
journal_source_facet Logical Methods in Computer Science
publishDate 2026
publishDateSort 2026
record_format rss_article
spellingShingle Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
Computer Sciience
General
Computer Sciience
sub_discipline_display General
sub_discipline_facet General
subject_display Computer Sciience
General
Computer Sciience
Computer Sciience
General
Computer Sciience
subject_facet Computer Sciience
General
Computer Sciience
title Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
title_auth Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
title_full Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
title_fullStr Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
title_full_unstemmed Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
title_short Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
title_sort dense integer-complete synthesis for bounded parametric timed automata
topic Computer Sciience
General
Computer Sciience
url https://doi.org/10.46298/lmcs-22(2:11)2026