17 search results - page 2 / 4 » Towards State Space Reduction Based on T-Lumpability-Consist... |
CONCUR
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
IAT
2009
IEEE
13 years 11 months ago
2009
IEEE
—Commitments based on branching time logic are powerful representations for modeling multi-agent interactions. Current approaches into commitments have conceived these representa...
AMAST
2008
Springer
13 years 7 months ago
2008
Springer
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
CODES
2003
IEEE
13 years 10 months ago
2003
IEEE
One of the most challenging problems in high-level synthesis is how to quickly explore a wide range of design options to achieve high-quality designs. This paper presents an Integ...
CSFW
1999
IEEE
13 years 9 months ago
1999
IEEE
We propose an efficient automatic checking algorithm, Athena, for analyzing security protocols. Athena incorporates a logic that can express security properties including authenti...