Sciweavers

71 search results - page 3 / 15
» An Unfolding Algorithm for Synchronous Products of Transitio...
Sort
View
APSEC
2005
IEEE
13 years 11 months ago
A Temporal Logic for Input Output Symbolic Transition Systems
— In this paper, we present a temporal logic called F whose interpretation is over Input Output Symbolic Transition Systems (IOSTS). IOSTS extend transition systems to communicat...
Marc Aiguier, Pascale Le Gall, Delphine Longuet, A...
ACSD
2005
IEEE
162views Hardware» more  ACSD 2005»
13 years 11 months ago
Complexity Results for Checking Distributed Implementability
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
Keijo Heljanko, Alin Stefanescu
CONCUR
2001
Springer
13 years 10 months ago
A Static Analysis Technique for Graph Transformation Systems
In this paper we introduce a static analysis technique for graph transformation systems. We present an algorithm which, given a graph transformation system and a start graph, produ...
Paolo Baldan, Andrea Corradini, Barbara König
AUSAI
2008
Springer
13 years 7 months ago
An Optimality Principle for Concurrent Systems
Abstract. This paper presents a formulation of an optimality principle for a new class of concurrent decision systems formed by products of deterministic Markov decision processes ...
Langford B. White, Sarah L. Hickmott
ESORICS
2006
Springer
13 years 9 months ago
Timing-Sensitive Information Flow Analysis for Synchronous Systems
Timing side channels are a serious threat to the security of cryptographic algorithms. This paper presents a novel method for the timing-sensitive analysis of information flow in s...
Boris Köpf, David A. Basin