Deadlock detection in communicating finite state machines by even reachability analysis
Mobile Networks and Applications - Special issue: protocols for mobile environments
Counter machines and verification Problems
Theoretical Computer Science
On Removing the Pushdown Stack in Reachability Constructions
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Verification in loosely synchronous queue-connected discrete timed automata
Theoretical Computer Science
Eliminating the storage tape in reachability constructions
Theoretical Computer Science
On Reachability Analysis of Communicating Finite State Machines
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Deadlock Detection in Communicating Finite State Machines by Even Reachability Analysis
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Context-bounded analysis of concurrent queue systems
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Communicating timed automata: the more synchronous, the more difficult to verify
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
A modular methodology to verify communication protocols
Computer Communications
Reachability and reverse reachability analysis of CFSMs
Computer Communications
| Hi-index | 0.00 |