The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Aniello Murano: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Orna Kupferman, Gila Morgenstern, Aniello Murano
    Typeness for omega-Regular Automata. [Citation Graph (0, 0)][DBLP]
    ATVA, 2004, pp:324-338 [Conf]
  2. Piero A. Bonatti, Carsten Lutz, Aniello Murano, Moshe Y. Vardi
    The Complexity of Enriched µ-Calculi. [Citation Graph (0, 0)][DBLP]
    ICALP (2), 2006, pp:540-551 [Conf]
  3. Salvatore La Torre, Aniello Murano
    Reasoning About Co-Büchi Tree Automata. [Citation Graph (0, 0)][DBLP]
    ICTAC, 2004, pp:527-542 [Conf]
  4. Salvatore La Torre, Supratik Mukhopadhyay, Aniello Murano
    Optimal-Reachability and Control for Acyclic Weighted Timed Automata. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:485-497 [Conf]
  5. Marco Faella, Salvatore La Torre, Aniello Murano
    Dense Real-Time Games. [Citation Graph (0, 0)][DBLP]
    LICS, 2002, pp:167-176 [Conf]
  6. Laura Bozzelli, Aniello Murano, Adriano Peron
    Pushdown Module Checking. [Citation Graph (0, 0)][DBLP]
    LPAR, 2005, pp:504-518 [Conf]
  7. Marco Faella, Salvatore La Torre, Aniello Murano
    Automata-Theoretic Decision of Timed Games. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2002, pp:94-108 [Conf]
  8. Salvatore La Torre, Aniello Murano, Margherita Napoli
    Weak Muller Acceptance Conditions for Tree Automata. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2002, pp:240-254 [Conf]
  9. Salvatore La Torre, Aniello Murano, Mimmo Parente
    Model-checking the Secure Release of a Time-locked Secret over a Network. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:99, n:, pp:229-243 [Journal]
  10. Orna Kupferman, Gila Morgenstern, Aniello Murano
    Typeness for omega-regular Automata. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:4, pp:869-884 [Journal]
  11. Salvatore La Torre, Aniello Murano, Margherita Napoli
    Weak Muller acceptance conditions for tree automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:233-250 [Journal]
  12. Benjamin Aminof, Aniello Murano, Moshe Y. Vardi
    Pushdown Module Checking with Imperfect Information. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2007, pp:460-475 [Conf]
  13. Dario Carotenuto, Aniello Murano, Adriano Peron
    2-Visibly Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2007, pp:132-144 [Conf]
  14. Alessandro Ferrante, Aniello Murano
    Enriched µ-Calculi Module Checking. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2007, pp:183-197 [Conf]
  15. Alessandro Ferrante, Aniello Murano, Mimmo Parente
    Enriched µ-Calculus Pushdown Module Checking. [Citation Graph (0, 0)][DBLP]
    LPAR, 2007, pp:438-453 [Conf]

  16. Exploring the Boundary of Half Positionality. [Citation Graph (, )][DBLP]


  17. Graded Computation Tree Logic with Binary Coding. [Citation Graph (, )][DBLP]


  18. Branching-Time Temporal Logics with Minimal Model Quantifiers. [Citation Graph (, )][DBLP]


  19. The "INNOVAMBIENTE" Project: An Interdisciplinary Approach Integrating Natural Science, Mathematics and Computer Science. [Citation Graph (, )][DBLP]


  20. µ-calculus Pushdown Module Checking with Imperfect State Information. [Citation Graph (, )][DBLP]


  21. Graded Computation Tree Logic. [Citation Graph (, )][DBLP]


  22. Program Complexity in Hierarchical Module Checking. [Citation Graph (, )][DBLP]


  23. Balanced Paths in Colored Graphs. [Citation Graph (, )][DBLP]


  24. Improved Model Checking of Hierarchical Systems. [Citation Graph (, )][DBLP]


  25. A technological infrastructure design for a pediatric oncology network. [Citation Graph (, )][DBLP]


  26. Enriched MU-Calculi Module Checking [Citation Graph (, )][DBLP]


  27. The Complexity of Enriched Mu-Calculi [Citation Graph (, )][DBLP]


  28. Quantitative Fairness Games [Citation Graph (, )][DBLP]


Search in 0.034secs, Finished in 0.035secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002