Sciweavers

4353 search results - page 99 / 871
» Expressiveness of Process Algebras
Sort
View
FORTE
2004
15 years 5 months ago
Composing Event Constraints in State-Based Specification
Abstract. Event-based process algebraic specification languages support an elegant specification technique by which system behaviours are described as compositions of constraints o...
Tommaso Bolognesi
ACSD
2006
IEEE
106views Hardware» more  ACSD 2006»
15 years 10 months ago
Synchronous + Concurrent + Sequential = Earlier than + Not later than
In this paper, we show how to obtain causal semantics distinguishing ”earlier than” and ”not later than” causality between events from algebraic semantics of Petri nets. J...
Gabriel Juhás, Robert Lorenz, Sebastian Mau...
LICS
2008
IEEE
15 years 10 months ago
Nonlocal Flow of Control and Kleene Algebra with Tests
Kleene algebra with tests (KAT) is an equational system for program verification that combines Kleene algebra (KA), or the algebra of regular expressions, with Boolean algebra. I...
Dexter Kozen
145
Voted
COOPIS
2003
IEEE
15 years 9 months ago
The Semantics of the Compound Term Composition Algebra
Abstract. In [11], we proposed an algebra with four algebraic operators, whose composition can be used to generate valid compound terms in a given faceted taxonomy in an efficient ...
Yannis Tzitzikas, Anastasia Analyti, Nicolas Spyra...
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
15 years 9 months ago
Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers
Recently proposed algebraic attacks [2, 6] and fast algebraic attacks [1, 5] have provided the best analyses against some deployed LFSR-based ciphers. The process complexity is exp...
Philip Hawkes, Gregory G. Rose