13 search results - page 2 / 3 » entcs 1998 |
ENTCS
1998
13 years 4 months ago
1998
ENTCS
1998
13 years 4 months ago
1998
ENTCS
1998
13 years 4 months ago
1998
We present two ways to de ne covarieties and complete covarieties, i.e. covarieties that are closed under total bisimulation: by closure operators and by subcoalgebras of coalgebr...
ENTCS
1998
13 years 4 months ago
1998
This paper shows how modal mu-calculus formulae characterizing finite-state processes up to strong or weak bisimulation can be derived directly from the well-known greatest fixp...
ENTCS
1998
13 years 4 months ago
1998
Designing a programming environment raises difficult implementation problems since such software is not just one piece of code able to execute programs expressed in a given progra...