Timed Semantics of Message Sequence Charts Based on Timed Automata
From MaRDI portal
Publication:2842583
DOI10.1016/S1571-0661(04)80475-4zbMath1270.68156MaRDI QIDQ2842583
Publication date: 15 August 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Untiming timed languages
- Model-checking in dense real-time
- A hierarchy of communication models for message sequence charts
- A theory of timed automata
- Symbolic model checking for real-time systems
- A theory of regular MSC languages
- Time, clocks, and the ordering of events in a distributed system
- Lectures on Concurrency and Petri Nets
- LSCs: Breathing life into message sequence charts
This page was built for publication: Timed Semantics of Message Sequence Charts Based on Timed Automata