Sciweavers

815 search results - page 93 / 163
» Algebraic Recognizability of Languages
Sort
View
FUIN
2002
94views more  FUIN 2002»
15 years 6 months ago
A Class of Composable and Preemptible High-level Petri Nets with an Application to Multi-Tasking Systems
This paper presents an extension of an algebra of high-level Petri nets with operations for suspension and abortion. These operations are sound with respect to the semantics of pre...
Hanna Klaudel, Franck Pommereau
IFIP
2004
Springer
15 years 11 months ago
Looking Inside AES and BES
We analyze an algebraic representation of AES–128 as an embedding in BES, due to Murphy and Robshaw. We present two systems of equations S and K concerning encryption and key gen...
Ilia Toli, Alberto Zanoni
ISPDC
2003
IEEE
15 years 11 months ago
Role Activity Diagrams as Finite State Processes
Many formal modelling notations for business processes have been proposed during the last decade. They can be broadly classified into high-level visual notations, with an intuiti...
Costin Badica, Amelia Badica, Valentin Litoiu
FM
1999
Springer
121views Formal Methods» more  FM 1999»
15 years 10 months ago
Incremental Design of a Power Transformer Station Controller Using a Controller Synthesis Methodology
ÐIn this paper, we describe the incremental specification of a power transformer station controller using a controller synthesis methodology. We specify the main requirements as s...
Hervé Marchand, Mazen Samaan
CSFW
1996
IEEE
15 years 10 months ago
Comparing Two Information Flow Security Properties
In this paper we compare two information flow security properties: the lazy security (L-Sec) [11] and the Bisimulation Non-deducibility on Compositions (BNDC) [4]. To make this we...
Riccardo Focardi