Sciweavers

122 search results - page 21 / 25
» Using Disjoint Reachability for Parallelization
Sort
View
ENTCS
2006
173views more  ENTCS 2006»
13 years 7 months ago
Concurrent LSC Verification: On Decomposition Properties of Partially Ordered Symbolic Automata
Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
Tobe Toben, Bernd Westphal
CDC
2008
IEEE
131views Control Systems» more  CDC 2008»
14 years 1 months ago
Probabilistic testing for stochastic hybrid systems
— In this paper we propose a testing based method for safety/ reachability analysis of stochastic hybrid systems. Testing based methods are characterized by analysis based on the...
A. Agung Julius, George J. Pappas
IEICET
2006
114views more  IEICET 2006»
13 years 7 months ago
Synchronization Verification in System-Level Design with ILP Solvers
Concurrency is one of the most important issues in system-level design. Interleaving among parallel processes can cause an extremely large number of different behaviors, making de...
Thanyapat Sakunkonchak, Satoshi Komatsu, Masahiro ...
COCOON
2005
Springer
14 years 28 days ago
On Sequential and 1-Deterministic P Systems
Abstract. The original definition of P-systems calls for rules to be applied in a maximally parallel fashion. However, in some cases a sequential model may be a more reasonable as...
Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe...
CONCUR
2005
Springer
14 years 28 days ago
The Individual and Collective Token Interpretations of Petri Nets
Starting from the opinion that the standard firing rule of Petri nets embodies the collective token interpretation of nets rather than their individual token interpretation, I pro...
Rob J. van Glabbeek