Sciweavers

5863 search results - page 192 / 1173
» On Model-Checking of P Systems
Sort
View
ISSTA
1998
ACM
15 years 11 months ago
Verifying Systems with Integer Constraints and Boolean Predicates: A Composite Approach
Symbolic model checking has proved highly successful for large nite-state systems, in which states can be compactly encoded using binary decision diagrams (BDDs) or their variants...
Tevfik Bultan, Richard Gerber, Christopher League
DATE
2010
IEEE
126views Hardware» more  DATE 2010»
15 years 10 months ago
Scenario-based analysis and synthesis of real-time systems using uppaal
Abstract. We propose an approach to scenario-based analysis and synthesis of real-time embedded systems. The inter-process behaviors of a system are modeled as a set of driving uni...
Kim Guldstrand Larsen, Shuhao Li, Brian Nielsen, S...
FDL
2011
IEEE
14 years 6 months ago
Integrating system descriptions by clocked guarded actions
—For the description of reactive systems, there is a large number of languages and formalisms, and depending on a particular application or design phase, one of them may be bette...
Jens Brandt, Mike Gemunde, Klaus Schneider, Sandee...
SIGMOD
2008
ACM
188views Database» more  SIGMOD 2008»
16 years 7 months ago
Just-in-time query retrieval over partially indexed data on structured P2P overlays
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...
Sai Wu, Jianzhong Li, Beng Chin Ooi, Kian-Lee Tan
IPTPS
2004
Springer
16 years 12 days ago
Cluster Computing on the Fly: P2P Scheduling of Idle Cycles in the Internet
— Peer-to-peer computing, the harnessing of idle compute cycles throughout the Internet, offers exciting new research challenges in the converging domains of networking and distr...
Virginia Mary Lo, Daniel Zappala, Dayi Zhou, Yuhon...