3 search results - page 1 / 1 » Concurrent LSC Verification: On Decomposition Properties of ... |
ENTCS
2006
13 years 4 months ago
2006
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...
SIGSOFT
2009
ACM
14 years 5 months ago
2009
ACM
We propose a new algorithm for verifying concurrent programs, which uses concrete executions to partition the program into a set of lean partitions called concurrent trace program...
ATVA
2006
Springer
13 years 8 months ago
2006
Springer
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...