Sciweavers

227 search results - page 21 / 46
» P Systems and Finite Automata
Sort
View
EUROMICRO
2009
IEEE
14 years 1 months ago
Formal Semantics of the ProCom Real-Time Component Model
ProCom is a new component model for real-time and embedded systems, targeting the domains of vehicular and telecommunication systems. In this paper, we describe how the architectur...
Aneta Vulgarakis, Jagadish Suryadevara, Jan Carlso...
IJNSEC
2010
324views more  IJNSEC 2010»
13 years 4 months ago
Computing the Modular Inverse of a Polynomial Function over GF(2P) Using Bit Wise Operation
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
Rajaram Ramasamy, Amutha Prabakar Muniyandi
LISP
2008
101views more  LISP 2008»
13 years 9 months ago
Flow-sensitive type systems and the ambient calculus
The Ambient Calculus was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code. Numerous analyses have been developed for numerous va...
Torben Amtoft
RTSS
2007
IEEE
14 years 4 months ago
Composing Functional and State-Based Performance Models for Analyzing Heterogeneous Real-Time Systems
— We present a performance analysis technique for distributed real-time systems in a setting where certain components are modeled in a purely functional manner, while the remainin...
Linh T. X. Phan, Samarjit Chakraborty, P. S. Thiag...
CADE
2008
Springer
14 years 10 months ago
Certifying a Tree Automata Completion Checker
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
Benoît Boyer, Thomas Genet, Thomas P. Jensen