On Implementable Timed Automata

DOI10.1007/978-3-030-50086-3_5OpenAlexW3034233614MaRDI QIDQ5041274

Bernd Westphal, Milan Vujinović, Sergio Feo-Arenis

Publication date: 13 October 2022

Published in: Formal Techniques for Distributed Objects, Components, and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-50086-3_5

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• SIGNAL
• Uppaal
• LUSTRE
• Giotto
• Esterel

Cites Work

• Unnamed Item
• Unnamed Item
• Synchronous programming with events and relations: The SIGNAL language and its semantics
• The Esterel synchronous programming language: Design, semantics, implementation
• On global scheduling independency in networks of timed automata
• A structural approach to operational semantics
• Dynamical properties of timed automata
• Almost ASAP semantics: from timed models to timed implementations
• Rigorous implementation of real-time systems – from theory to application
• A Process Algebra for Wireless Mesh Networks
• Timed Automata Can Always Be Made Implementable
• Compositional Abstraction in Real-Time Model Checking
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Formal Methods for the Design of Real-Time Systems
• Real-Time Systems

This page was built for publication: On Implementable Timed Automata