656 search results - page 36 / 132 » A Formalization of Transition P Systems |
FUIN
2007
15 years 17 days ago
2007
A formal model for description of passive and active timing attacks is presented, studied and compared with other security concepts. It is based on a timed process algebra and on a...
102
click to vote
FM
2003
Springer
15 years 5 months ago
2003
Springer
Software systems are often model checked by translating them into a directly model-checkable formalism. Any serious software system requires application of compositional reasoning ...
103
click to vote
BIRTHDAY
2005
Springer
15 years 6 months ago
2005
Springer
The “classical” approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This ...
109
click to vote
HYBRID
2005
Springer
15 years 6 months ago
2005
Springer
This paper deals with polynomial stochastic hybrid systems (pSHSs), which generally correspond to stochastic hybrid systems with polynomial continuous vector fields, reset maps, a...
98
Voted
HYBRID
2004
Springer
15 years 6 months ago
2004
Springer
We propose a model for Stochastic Hybrid Systems (SHSs) where transitions between discrete modes are triggered by stochastic events much like transitions between states of a contin...