Rule Formats for Timed Processes
From MaRDI portal
Publication:2841307
DOI10.1016/S1571-0661(04)80498-5zbMath1268.68128MaRDI QIDQ2841307
Publication date: 24 July 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
68Q55: Semantics in the theory of computing
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Bialgebras for structural operational semantics: an introduction, Bialgebraic methods and modal logic in structural operational semantics, Bialgebraic Methods in Structural Operational Semantics, Structural Operational Semantics for Weighted Transition Systems
Cites Work
- Unnamed Item
- Unnamed Item
- CMCS `99. Proceedings of the 2nd workshop on Coalgebraic methods in computer science. A satellite event to the European joint conferences on Theory and practice of software, ETAPS `99. Amsterdam, the Netherlands, March 20--21, 1999
- A theory of timed automata
- Combining a monad and a comonad
- Compositional SOS and beyond: A coalgebraic view of open systems
- GSOS for probabilistic transition systems
- Bisimulation can't be traced
- A final coalgebra theorem