711 search results - page 130 / 143 » Modal Logics are Coalgebraic |
FSTTCS
2004
Springer
15 years 3 months ago
2004
Springer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
RSCTC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This paper focuses on the use and interpretation of approximate databases where both rough sets and indiscernibility partitions are generalized and replaced by approximat...
TACAS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Failing model checking runs should be accompanied by appropriate error diagnosis information that allows the user to identify the cause of the problem. For branching time...
114
click to vote
CSFW
2003
IEEE
15 years 3 months ago
2003
IEEE
We provide a framework for reasoning about information-hiding requirements in multiagent systems and for reasoning about anonymity in particular. Our framework employs the modal l...
AMAST
1997
Springer
15 years 2 months ago
1997
Springer
A symbolic semantics for Full LOTOS in terms of symbolic transition systems is de ned, following the approach taken for message passing CCS in HL95a], altered to take account of th...