Sciweavers

4126 search results - page 409 / 826
» Relationships with other Formalisms
Sort
View
FORMATS
2007
Springer
16 years 1 months ago
Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
Sergio Giro, Pedro R. D'Argenio
FSTTCS
2007
Springer
16 years 1 months ago
Safely Composing Security Protocols
Security protocols are small programs that are executed in hostile environments. Many results and tools have been developed to formally analyze the security of a protocol. However ...
Véronique Cortier, Jérémie De...
ICCS
2007
Springer
16 years 1 months ago
Composing Different Models of Computation in Kepler and Ptolemy II
A model of computation (MoC) is a formal abstraction of execution in a computer. There is a need for composing MoCs in e-science. Kepler, which is based on Ptolemy II, is a scienti...
Antoon Goderis, Christopher Brooks, Ilkay Altintas...
ICESS
2007
Springer
16 years 1 months ago
A Code Generation Framework for Actor-Oriented Models with Partial Evaluation
Embedded software requires concurrency formalisms other than threads and mutexes used in traditional programming languages like C. Actor-oriented design presents a high level abstr...
Gang Zhou, Man-Kit Leung, Edward A. Lee
PRIMA
2007
Springer
16 years 1 months ago
An Asymmetric Protocol for Argumentation Games in Defeasible Logic
Agent interactions where the agents hold conflicting goals could be modelled as adversarial argumentation games. In many real-life situations (e.g., criminal litigation, consumer ...
Jenny Eriksson Lundström, Guido Governatori, ...