Untiming timed languages

DOI10.1016/0020-0190(95)00077-PzbMath1004.68532OpenAlexW2058223087MaRDI QIDQ672021

Béatrice Bérard

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00077-p

zbMATH Keywords

real-time systemstimed languagestimed transition systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Removing ε-transitions in timed automata, An automata-theoretic approach to constraint LTL, Verification of qualitative \(\mathbb Z\) constraints, Reachability in Timed Counter Systems, Timed Semantics of Message Sequence Charts Based on Timed Automata, Timed automata and additive clock constraints

Cites Work

• Unnamed Item
• Langages sur des alphabets infinis
• A theory of timed automata