Communicating sequential processes
Communicating sequential processes
Theoretical Computer Science
The algebra of timed processes, ATP: theory and application
Information and Computation
Journal of the ACM (JACM)
A process algebra for timed systems
Information and Computation
Communication and Concurrency
Handbook of Process Algebra
Proceedings of the 3rd International Workshop on Computer Aided Verification
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Design and verification in real-time distributed computing: an introduction to compositional methods
Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX
Real-Time Behaviour of Asynchronous Agents
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
A Temporal Calculus of Communicating Systems
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
An Overview and Synthesis on Timed Process Algebras
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Category Theory and Computer Science
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A Comparison of Additivity Axioms in Timed Transition Systems.
A Comparison of Additivity Axioms in Timed Transition Systems.
Category theory for operational semantics
Theoretical Computer Science - Selected papers of CMCS'03
Coalgebraic semantics for timed processes
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Bialgebraic Methods in Structural Operational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Modular construction of complete coalgebraic logics
Theoretical Computer Science
Bialgebraic methods and modal logic in structural operational semantics
Information and Computation
Modularity of Behaviours for Mathematical Operational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
On Equivalences for a Class of Timed Regular Expressions
Electronic Notes in Theoretical Computer Science (ENTCS)
Coalgebraic semantics for timed processes
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
| Hi-index | 0.00 |
We give an abstract axiomatic account of timed processes using monoids and their (partial and total) actions. Subsequently, we present categorical formulations thereof, including a novel characterisation of partial monoid actions as coalgebras for an evolution comonad. Adapting the approach of Turi and Plotkin [24], we then exhibit an abstract theory of well-behaved operational rules suitable for timed processes and, for discrete time, also derive a concrete syntactic format encompassing all rules we found in the literature.