Sciweavers

656 search results - page 102 / 132
» A Formalization of Transition P Systems
Sort
View
86
Voted
JLP
2006
56views more  JLP 2006»
15 years 10 days ago
Linearization of hybrid processes
We present an algorithm for the linearization of hybrid processes modeled in hybrid process algebra (HyPA) and prove its correctness. HyPA is a formalism that is suitable for the ...
P. C. W. den Brand van, Michel A. Reniers, Pieter ...
ACTA
2002
86views more  ACTA 2002»
15 years 7 days ago
Deriving and paraphrasing information grammars using object-oriented analysis models
Abstract. In this paper the focus is on object-oriented analysis of information systems. We assume that the communication within an application domain can be described by a logbook...
Paul J. M. Frederiks, Theo P. van der Weide
GLOBECOM
2010
IEEE
14 years 9 months ago
Skip Finite Automaton: A Content Scanning Engine to Secure Enterprise Networks
Abstract--Today's file sharing networks are creating potential security problems to enterprise networks, i.e., the leakage of confidential documents. In order to prevent such ...
Junchen Jiang, Yi Tang, Bin Liu, Yang Xu, Xiaofei ...
ECEASST
2006
103views more  ECEASST 2006»
15 years 12 days ago
Petri Nets and Matrix Graph Grammars: Reachability
This paper contributes in two directions. First, several concepts of our matrix approach to graph transformation [1,2] such as coherence and minimal initial digraph are applied to ...
Juan de Lara, Pedro Pablo Pérez Velasco
SPIN
2005
Springer
15 years 5 months ago
Behavioural Models for Hierarchical Components
We describe a method for the specification and verification of the dynamic behaviour of component systems. Building applications using a component framework allows the developers...
Tomás Barros, Ludovic Henrio, Eric Madelain...