A logic for graphs with QoS

Electronic Notes in Theoretical Computer Science

Volumn 142, Issue SPEC. ISS., 2006, Pages 143-160

  Ferrari, Gianluigi ^a   Lluch Lafuente, Alberto ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Distributed Systems; Graph Logics; QoS; Semirings

Indexed keywords

DISTRIBUTED SYSTEMS; GRAPH LOGICS; SEMIRINGS;

BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; FORMAL LOGIC; GRAPH THEORY;

QUALITY OF SERVICE;

EID: 29244489188     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.10.030     Document Type: Conference Paper

References (29)

1. C. Baier, B. Havekort, H. Hermanns, and J.-P. Katoen Model checking continuous-time Markov chains by transient analyisis Computer Aided Verification LNCS 1855 2000 358 372
2. P. Baldan, A. Corradini, B. König, and B. König Verifying a behavioural logic for graph transformation systems CoMeta'03 ENTCS 2004
3. Bella, G. and S. Bistarelli, Soft constraint programming to analysing security protocols, Theory and Practice of Logic Programming To appear
4. S. Bistarelli, U. Montanari, and F. Rossi Semiring-based constraint satisfaction and optimization Journal of the ACM 44 1997 201 236
5. S. Bistarelli, U. Montanari, and F. Rossi Soft constraint logic programming and generalized shortest path problems Journal of Heuristics 8 2002 25 41
6. Caires, L. and L. Cardelli, A spatial logic for concurrency (part II), in: Proceedings of the 13th International Conference on Concurrency Theory (2002), pp. 209-225
7. L. Caires, and L. Cardelli A spatial logic for concurrency (part I) Inf. Comput. 186 2003 194 235
8. L. Cardelli, P. Gardner, and G. Ghelli A spatial logic for querying graphs Peter Widmayer ICALP'2002 Lecture Notes in Computer Science 2380 2002 597 610
9. L. Cardelli, P. Gardner, and G. Ghelli Manipulating trees with hidden labels Foundations of Software Science and Computation Structures (FOSSACS) Lecture Notes in Computer Science 2003 216 232
10. Chechik, M., S. Easterbrook and A. Gurfinkel, Multi-valued symbolic model-checking, AC Transactions on Software Engineering and Methodology (2003), to appear
11. E. Clarke, and J. Wing Formal methods: State of the art and future directions AC Computing Surveys 28 1996 626 643
12. E.M. Clarke, O. Grumberg, and D.A. Peled Model Checking 1999 MIT Press
13. A. Corradini, U. Montanari, and F. Rossi An abstract machine for concurrent modular systems: Charm Theoretical Computer Science 1994 165 200
14. B. Courcelle Handbook of graph grammars and computing by graph transformations Theoretical Computer Science 1 : Foundations 1997 World Scientific 313 400
15. Dawar, A., P. Gardner and G. Ghelli, Expressiveness and complexity of graph logic, Technical Report 2004/3, Imperial College, Department of Computing (2004)
16. L. de Alfaro Quantitative verification and control via the mu-calculus R.M. Amadio D. Lugiez Proceedings of 14th International Conference on Concurrency Theory Lecture Notes in Computer Science 2761 2003 102 126
17. Demmer, M.J. and M. Herlihy, The arrow distributed directory protocol, in: International Symposium on Distributed Computing (DISC 98), 1998, pp. 119-133
18. Z. Duan, Z. Zhang, and Y.T. Hou Service overlay networks: SLAs, QoS, and bandwidth provisioning IEEE/ACM Transactions on Networking (TON) 11 2003 870 883
19. H. Ehrig G. Engels H.-J. Kreowski G. Rozenberg Handbook of Graph Grammars and Computing by Graph Transformation 1999 World Scientific
20. Fink, E., A survey of sequential and systolic algorithms for the algebraic path problem, Technical Report CS-92-37, Department of Computer Science, University of Waterloo (1992)
21. Gaubert, S., Methods and applications of (max,+) linear algebra, Technical Report 3088, Institut National de Recherche en Informatiqu et en Automatique (1997)
22. Gu, X., K. Nahrstedt, R. Chang and C. Ward, QoS-assured service composition in managed service overlay networks, in: IEEE International Conference on Distributed Computing Systems (ICDCS2003) (2003)
23. A. Lluch-Lafuente, and U. Montanari Quantitative mu-calculus and CTL based on constraint semirings A. Cerone A. di Pierro 2nd Workshop on Quantitative Aspects of Programming Languages Electronic Notes in Theoretical Computer Science 2004
24. R. Milner Communication and Concurrency 1989 Prentice Hall
25. Rensink, A., Towards model checking graph grammars, in: 3rd Workshop on Automated Verification of Critical Systems, Tech. Report DSSE-TR-2003, 2003, pp. 150-160
26. J. Reynolds Separation logic: A logic for shared mutable data structures LICS 2002 2002 55 74
27. A. Rote A systolic array algorithm for the algebraic path problem (shortest path; matrix inversion) Computing 1985 191 219
28. A. Tarski A lattice-theoretical fixpoint theorem and its applications Pacific Journal of Mathematics 1955
29. O. Younis, and S. Fahmy Constraint-based routing in the internet: Basic principles and recent research IEEE Communications Surveys and Tutorials 5 2003