Automatic verification of multi-queue discrete timed automata

DOI10.1007/3-540-45071-8_18MaRDI QIDQ3082924zbMATH OpenOpenAlexFDO

Authors Pierluigi San Pietro, Zhe Dang

Publication date 18 March 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45071-8_18

zbMATH Keywords

infinite-state model-checkingreal-time systemstimed automata

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Verification in loosely synchronous queue-connected discrete timed automata.
• Augmenting the discrete timed automaton with other data structures.
• VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES
• Verification for Timed Automata extended with Unbounded Discrete Data Structures
• Verification for timed automata extended with unbounded discrete data structures

Cited in

(3)

• Verification in loosely synchronous queue-connected discrete timed automata.
• On composition and lookahead delegation of \(e\)-services modeled by automata
• A survey of timed automata for the development of real-time systems

This page was built for publication: Automatic verification of multi-queue discrete timed automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3082924)