656 search results - page 11 / 132 » A Formalization of Transition P Systems |
FTRTFT
1998
Springer
15 years 1 months ago
1998
Springer
We present a compositional semantics of synchronous systems that captures both safety and progress properties of such systems. The fair synchronous transitions systems (fsts) mode...
CONCUR
1999
Springer
15 years 1 months ago
1999
Springer
This paper discusses the use of formal methods in testing of concurrent systems. It is argued that formal methods and testing can be mutually profitable and useful. A framework fo...
SYNASC
2005
IEEE
15 years 3 months ago
2005
IEEE
— A framework that describes the evolution of P systems with bounded parallelism is defined by introducing basic formal features that can be then integrated into a structural op...
ICTAC
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. Given a nite state machine denoting the speci cation of a system, nding some short interaction sequences capable to reach some/all states or transitions of this machine...
80
Voted
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—We propose a novel search mechanism for unstructured p2p networks, and show that it is both scalable, i.e., it leads to a bounded query traffic load per peer as the pee...