Model checking on timed-event structures

Author(s):  
P. Dasgupta ◽  
J.K. Deka ◽  
P.P. Chakrabarti
1996 ◽  
Vol 06 (04) ◽  
pp. 583-594 ◽  
Author(s):  
DOMINIQUE AMBROISE ◽  
BRIGITTE ROZOY

Abstract: Traces and partial orders have been used as an approach to reduce time and memory in model-checking for concurrent programs. We show here that we can also make use of event structures and generalized traces: we extend algorithms for partial orders and traces by using event structure to generate reachability graphs; we gain for two reasons: first resulting algorithms are optimal and second a careful implementation spares memory.


Author(s):  
James Kapinski ◽  
Alexandre Donze ◽  
Flavio Lerda ◽  
Hitashyam Maka ◽  
Edmund Clarke ◽  
...  

2019 ◽  
Vol 13 (3) ◽  
pp. 1
Author(s):  
ALIYU E. O. ◽  
ADEWALE O. S. ◽  
ADETUNMBI A. O. ◽  
OJOKOH B. A. ◽  
◽  
...  
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document