Reachability Problems

book24h

Power User
LV
5
 
Csatlakozás
2024.09.10.
Üzenetek
25,515
Reakció pontszám
8
Díjak
5
Kor
37
77a8615c37094a0d5ae5f8395cd907a3.webp

Free Download Olivier Bournez, Igor Potapov, "Reachability Problems"
English | 2009 | pages: 242 | ISBN: 3642044190 | PDF | 3,7 mb
This book constitutes the research papers presented at the 3rd International Workshop, RP 2009 held in Palaiseau, France, September 23-25, 2009. The 20 full papers of this workshop reflect reachability problems that appear in algebraic structures, computational models, hybrid systems and verification. Reachability is a fundamental problem in the context of many models and abstractions which are describing various computational processes. Topics of interest include reachability problems in infinite state systems, rewriting systems, dynamical and hybrid systems, reachability problems in logic and verification, reachability analysis in different computational models, counter, timed, cellular, communicating automata, Petri-Nets, computational aspects of algebraic structures and predictability in iterative maps and new computational paradigms.


Buy Premium From My Links To Get Resumable Support,Max Speed & Support Me
Code:
            
                
                
                    
                   
                    A kód megtekintéséhez jelentkezz be.
					Please log in to view the code.
                
            
        
Links are Interchangeable - Single Extraction
 
Top Alul