An algebraic framework for urgency

DOI10.1006/inco.2000.2999zbMath1007.68119OpenAlexW2025975926MaRDI QIDQ1854390

Sébastien Bornot, Joseph Sifakis

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2000.2999

zbMATH Keywords

timed automata

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Structural transformations for data-enriched real-time systems ⋮ Logical time control of concurrent DES ⋮ Rigorous implementation of real-time systems – from theory to application

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The algorithmic analysis of hybrid systems
• Priorities in process algebras
• Calculi for synchrony and asynchrony
• A process algebra with distributed priorities
• Symbolic model checking for real-time systems
• A process algebra of communicating shared resources with dense time and priorities
• Compositional specification of timed systems
• A process algebra with distributed priorities

This page was built for publication: An algebraic framework for urgency