Rule formats for timed processes

DOI10.1016/S1571-0661(04)80498-5zbMATH Open1268.68128MaRDI QIDQ2841307FDOQ2841307

Authors: Marco Kick 

Publication date: 24 July 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 2086649
• An operational semantics for timed CSP
• SOS formats and meta-theory: 20 years after
• A CALCULUS OF TIMED COMMUNICATING SYSTEMS
• Coalgebraic semantics for timed processes

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• A theory of timed automata
• Bisimulation can't be traced
• A final coalgebra theorem
• Combining a monad and a comonad
• Compositional SOS and beyond: A coalgebraic view of open systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• GSOS for probabilistic transition systems (extended abstract)
• 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

Cited In (7)

• Coalgebraic semantics for timed processes
• Bialgebraic methods in structural operational semantics (invited talk)
• Bialgebras for structural operational semantics: an introduction
• Title not available (Why is that?)
• 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)