Sciweavers

825 search results - page 132 / 165
» Modal Logics with Counting
Sort
View
AMAST
2006
Springer
13 years 11 months ago
Hyperfinite Approximations to Labeled Markov Transition Systems
The problem of finding an approximation to a labeled Markov transition system through hyperfinite transition systems is addressed. It is shown that we can find for each countable ...
Ernst-Erich Doberkat
IPL
2010
95views more  IPL 2010»
13 years 6 months ago
Resource bisimilarity and graded bisimilarity coincide
Resource bisimilarity has been proposed in the literature on concurrency theory as a notion of bisimilarity over labeled transition systems that takes into account the number of c...
Luca Aceto, Anna Ingólfsdóttir, Josh...
DASC
2006
IEEE
14 years 2 months ago
Analysing Stream Authentication Protocols in Autonomous Agent-Based Systems
Abstract— In stream authentication protocols used for largescale data dissemination in autonomuous systems, authentication is based on the timing of the publication of keys, and ...
Mehmet A. Orgun, Ji Ma, Chuchang Liu, Guido Govern...
FSTTCS
2005
Springer
14 years 1 months ago
Quantitative Models and Implicit Complexity
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
Ugo Dal Lago, Martin Hofmann
SEMWEB
2004
Springer
14 years 1 months ago
Working with Multiple Ontologies on the Semantic Web
The standardization of the second generation Web Ontology Language, OWL, leaves a crucial issue for Web-based ontologies unsatisfactorily resolved: how to represent and reason with...
Bernardo Cuenca Grau, Bijan Parsia, Evren Sirin