The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Taolue Chen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Taolue Chen, Tingting Han, Jian Lu
    Framework of Performance Evaluation for Mobile Process Based on Mobile Ambient. [Citation Graph (0, 0)][DBLP]
    CIT, 2004, pp:540-545 [Conf]
  2. Taolue Chen, Tingting Han, Jian Lu
    Analysis of A Leader Election Algorithm in uCRL. [Citation Graph (0, 0)][DBLP]
    CIT, 2005, pp:841-847 [Conf]
  3. Taolue Chen, Tingting Han, Jian Lu
    Towards a Model Logic for p-Calculus. [Citation Graph (0, 0)][DBLP]
    COMPSAC, 2004, pp:330-335 [Conf]
  4. Tingting Han, Taolue Chen, Jian Lu
    Structure Analysis for Dynamic Software Architecture Based on Spatial Logic. [Citation Graph (0, 0)][DBLP]
    COMPSAC (1), 2005, pp:71-76 [Conf]
  5. Taolue Chen, Wan Fokkink
    On Finite Alphabets and Infinite Bases III: Simulation. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:421-434 [Conf]
  6. Taolue Chen, Wan Fokkink, Sumit Nain
    On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2006, pp:1-15 [Conf]
  7. Taolue Chen, Tingting Han, Jian Lu
    On the Markovian Randomized Strategy of Controller for Markov Decision Processes. [Citation Graph (0, 0)][DBLP]
    FSKD, 2006, pp:149-158 [Conf]
  8. Taolue Chen, Tingting Han, Jian Lu
    On the Bisimulation Congruence in chi-Calculus. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:128-139 [Conf]
  9. Luca Aceto, Taolue Chen, Wan Fokkink, Anna Ingólfsdóttir
    On the Axiomatizability of Priority. [Citation Graph (0, 0)][DBLP]
    ICALP (2), 2006, pp:480-491 [Conf]
  10. Tingting Han, Taolue Chen, Jian Lu
    Structure Analysis for Dynamic Software Architecture. [Citation Graph (0, 0)][DBLP]
    SNPD, 2005, pp:338- [Conf]
  11. Taolue Chen, Tingting Han, Jian Lu
    On the Complete Axiomatization for Prefix Iteration modulo Observation Congruence. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 2006, v:17, n:3, pp:- [Journal]
  12. Taolue Chen, Tingting Han, Jian Lu
    Intensionality of modal logic for Robust Ambient Calculus. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:85, n:1, pp:- [Journal]
  13. Taolue Chen, Tingting Han, Jian Lu
    A Modal Logic for pi-Calculus and Model Checking Algorithm. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:123, n:, pp:19-33 [Journal]
  14. Taolue Chen, Jingyang Zhou, Tingting Han, Jian Lu
    Checking Strong Open Congruence in Chi -Calculus. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:91, n:, pp:4-20 [Journal]
  15. Taolue Chen, Bas Ploeger, Jaco van de Pol, Tim A. C. Willemse
    Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2007, pp:120-135 [Conf]
  16. Taolue Chen, Tingting Han, Jian Lu
    Tree logic with recursion and model checking algorithm. [Citation Graph (0, 0)][DBLP]
    IASTED Conf. on Software Engineering and Applications, 2004, pp:588-593 [Conf]

  17. LTL Model Checking of Time-Inhomogeneous Markov Chains. [Citation Graph (, )][DBLP]


  18. Towards the Complexity of Controls for Timed Automata with a Small Number of Clocks. [Citation Graph (, )][DBLP]


  19. On Behavioral Metric for Probabilistic Systems: Definition and Approximation Algorithm. [Citation Graph (, )][DBLP]


  20. Probabilistic Alternating-time Temporal Logic and Model Checking Algorithm. [Citation Graph (, )][DBLP]


  21. On the Axiomatizability of Impossible Futures: Preorder versus Equivalence. [Citation Graph (, )][DBLP]


  22. Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications. [Citation Graph (, )][DBLP]


  23. On Finite Bases for Weak Semantics: Failures Versus Impossible Futures. [Citation Graph (, )][DBLP]


  24. Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata. [Citation Graph (, )][DBLP]


  25. PDL over Accelerated Labeled Transition Systems. [Citation Graph (, )][DBLP]


  26. Time-Abstracting Bisimulation for Probabilistic Timed Automata. [Citation Graph (, )][DBLP]


  27. On Finite Bases for Weak Semantics: Failures versus Impossible Futures [Citation Graph (, )][DBLP]


  28. Complete Axiomatization for Divergent-Sensitive Bisimulations in Basic Process Algebra with Prefix Iteration. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
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