Rule formats for timed processes
From MaRDI portal
Publication:2841307
Recommendations
Cites work
- scientific article; zbMATH DE number 1497875 (Why is no real title available?)
- scientific article; zbMATH DE number 1759488 (Why is no real title available?)
- A final coalgebra theorem
- A theory of timed automata
- Bisimulation can't be traced
- 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
- Combining a monad and a comonad
- Compositional SOS and beyond: A coalgebraic view of open systems
- GSOS for probabilistic transition systems (extended abstract)
Cited in
(7)- Coalgebraic semantics for timed processes
- Bialgebras for structural operational semantics: an introduction
- Bialgebraic methods in structural operational semantics (invited talk)
- scientific article; zbMATH DE number 2086649 (Why is no real title available?)
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
- Structural Operational Semantics for Weighted Transition Systems
- Bialgebraic methods and modal logic in structural operational semantics
This page was built for publication: Rule formats for timed processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841307)