Structural transformations for data-enriched real-time systems
DOI10.1007/s00165-014-0306-yzbMath1319.68150OpenAlexW2060145396MaRDI QIDQ493518
Mani Swaminathan, Ernst-Ruediger Olderog
Publication date: 3 September 2015
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-014-0306-y
flatteningseparationcommunication closednessextended timed automatalayered compositionlayered reachabilitynon-interference and precedencereal-time mutual exclusionstructural transformations
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)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposition of distributed programs into communication-closed layers
- A theory of timed automata
- A principle for sequential reasoning about distributed algorithms
- An algebraic framework for urgency
- Layered reasoning for randomized distributed algorithms
- A partial order semantics approach to the clock explosion problem of timed automata
- Partial Order Reduction for Verification of Real-Time Components
- Layered Composition for Timed Automata
- A Reduction Theorem for the Verification of Round-Based Distributed Algorithms
- Timed Automata with Disjoint Activity
- Randomized mutual exclusion algorithms revisited
- Formal Methods for the Design of Real-Time Systems
- Real-Time Systems
This page was built for publication: Structural transformations for data-enriched real-time systems