A proof system for timed automata

DOI10.1007/3-540-46432-8_14MaRDI QIDQ4508304zbMATH OpenFDO

Authors Wang Yi, H. Lin

Publication date 28 May 2001

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

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

zbMATH Keywords

proof systemsymbolic timed bisimulation

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2080209
• Axiomatising timed automata
• Axiomatising real-timed processes
• A theory of timed automata
• Forward and backward simulations. II: Timing-based systems

Cited in

(15)

• Decidable verification for reducible timed automata specified in a first order logic with time
• The cones and foci proof technique for timed transition systems
• Axiomatising timed automata
• On the determinization of timed systems
• Forward and backward simulations. II: Timing-based systems
• A proof system for a unified temporal logic
• A proof-based method for modelling timed systems
• scientific article; zbMATH DE number 2080209 (Why is no real title available?)
• The Power of Proofs: New Algorithms for Timed Automata Model Checking
• Axiomatising real-timed processes
• Formal Modeling and Analysis of Timed Systems
• Proving sequential function chart programs using timed automata
• A complete axiomatization of timed bisimulation for a class of timed regular behaviours
• Towards verification of computation orchestration
• Verification of continuous dynamical systems by timed automata

This page was built for publication: A proof system for timed automata

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