An abstract machine for concurrent modular systems: CHARM
FGCS'921 Selected papers of the conference on Fifth generation computer systems
Formal methods: state of the art and future directions
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution
Model checking
Communication and Concurrency
Soft Constraint Logic Programming and Generalized Shortest Path Problems
Journal of Heuristics
Separation Logic: A Logic for Shared Mutable Data Structures
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
The Arrow Distributed Directory Protocol
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
A Spatial Logic for Querying Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Spatial Logic for Concurrency (Part II)
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Model Checking Continuous-Time Markov Chains by Transient Analysis
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
QoS-Assured Service Composition in Managed Service Overlay Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
A spatial logic for concurrency (part I)
Information and Computation - TACS 2001
Service overlay networks: SLAs, QoS, and bandwidth provisioning
IEEE/ACM Transactions on Networking (TON)
Multi-valued symbolic model-checking
ACM Transactions on Software Engineering and Methodology (TOSEM)
Soft constraint programming to analysing security protocols
Theory and Practice of Logic Programming
Quantitative μ-calculus and CTL Based on Constraint Semirings
Electronic Notes in Theoretical Computer Science (ENTCS)
Verifying a Behavioural Logic for Graph Transformation Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Manipulating trees with hidden labels
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Constraint-based routing in the internet: Basic principles and recent research
IEEE Communications Surveys & Tutorials
A Logic for Application Level QoS
Electronic Notes in Theoretical Computer Science (ENTCS)
Counterpart Semantics for a Second-Order μ-Calculus
Fundamenta Informaticae - Recent Developments in the Theory of Graph Transformation, 2010
| Hi-index | 0.00 |
We introduce a simple graph logic that supports specification of Quality of Service (QoS) properties of applications. The idea is that we are not only interested in representing whether two sites are connected, but we want to express the QoS level of the connection. The evaluation of a formula in the graph logic is a value of a suitable algebraic structure, a c-semiring, representing the QoS level of the formula and not just a boolean value expressing whether or not the formula holds. We present some examples and briefly discuss the expressiveness and complexity of our logic.