CONCUR 2004 - Concurrency Theory

DOI10.1007/B100113MaRDI QIDQ5311484zbMATH OpenOpenAlexFDO

Authors Pavel Krčál, Leonid Mokrushin, P. S. Thiagarajan, Wang Yi

Publication date 23 August 2005

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

Full work available at URL https://doi.org/10.1007/b100113

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Formal Modeling and Analysis of Timed Systems
• Timed Automata Can Always Be Made Implementable
• A theory of timed automata
• From scenarios to timed automata
• scientific article; zbMATH DE number 1507209

Cited in

(4)

• Shrinking timed automata
• scientific article; zbMATH DE number 1670795 (Why is no real title available?)
• Timed Automata with Integer Resets: Language Inclusion and Expressiveness
• Formal Modeling and Analysis of Timed Systems

This page was built for publication: CONCUR 2004 - Concurrency Theory

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