711 search results - page 137 / 143 » Modal Logics are Coalgebraic |
VMCAI
2009
Springer
15 years 4 months ago
2009
Springer
—A variety of partial modeling formalisms, aimed re and reason about abstractions, have been proposed. Some, e.g., Kripke Modal Transition Systems (KMTSs) put strong restrictions...
TIME
2009
IEEE
15 years 4 months ago
2009
IEEE
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...
BPM
2007
Springer
15 years 4 months ago
2007
Springer
Business process design is primarily driven by process improvement objectives. However, the role of control objectives stemming from regulations and standards is becoming increasin...
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
141
click to vote
GLOBAL
2003
Springer
15 years 3 months ago
2003
Springer
Klaim (Kernel Language for Agents Interaction and Mobility) is an experimental language specifically designed to program distributed systems consisting of several mobile component...