500 search results - page 1 / 100 » Coalgebraic semantics for timed processes |
IANDC
2006
13 years 4 months ago
2006
We give a coalgebraic formulation of timed processes and their operational semantics. We model time by a monoid called a "time domain", and we model processes by "t...
FOSSACS
2010
Springer
13 years 11 months ago
2010
Springer
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
CALCO
2005
Springer
13 years 10 months ago
2005
Springer
Recently, various process calculi have been introduced which are suited for the modelling of mobile computation and in particular the mobility of program code; a prominent example ...
CALCO
2009
Springer
13 years 11 months ago
2009
Springer
d abstract) Sam Staton Computer Laboratory, University of Cambridge Abstract. A labelled transition system can be understood as a coalgebra for a particular endofunctor on the cate...
ENTCS
2008
13 years 4 months ago
2008
Non-deterministic (also known as possibilistic) and probabilistic state based systems (or automata) have been studied for quite some time. Separately, they are reasonably well-und...