Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Blondin, Michael Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 2 of 2 reviews    
   Automata theory: an algorithmic approach
Esparza J., Blondin M., MIT Press, Cambridge, MA, 2023. 560 pp.  Type: Book (0262048639)

Novices to automata theory may want to start with Dines Bjørner’s narrative on principles and techniques, found in the automata theory chapter of his enjoyable three-volume set [1], which covers intuition, motivation, and pragmatics. Bjørner...
...
Feb 27 2024  
  The logical view on continuous Petri nets
Blondin M., Finkel A., Haase C., Haddad S. ACM Transactions on Computational Logic 18(3): 1-28, 2017.  Type: Article

The reachability problem for standard Petri nets is EXPSPACE hard, and the coverability problem is EXPSPACE complete. However, more efficient algorithms exist for variants of the standard nets. Continuous Petri nets are such a variant ...
...
Nov 17 2017  

   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy