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 ...
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...
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...
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...
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...