Share This Author
The Algorithmic Analysis of Hybrid Systems
Model-Checking in Dense Real-time
An algorithm for model-checking, for determining the truth of a TCTL-formula with respect to a timed graph, is developed and it is argued that choosing a dense domain instead of a discrete domain to model time does not significantly blow up the complexity of the model- checking problem.
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems
This work presents two semidecision procedures for verifying safety properties of piecewiselinear hybrid automata, in which all variables change at constant rates, and demonstrates that for many of the typical workshop examples, the procedures do terminate and thus provide an automatic way for verifying their properties.
The complexity of probabilistic verification
This work determines the complexity of testing whether a finite state, sequential or concurrent probabilistic program satisfies its specification expressed in linear-time temporal logic and addresses questions for specifications described by ω-automata or formulas in extended temporal logic.
Memory-efficient algorithms for the verification of temporal properties
- C. Courcoubetis, Moshe Y. Vardi, P. Wolper, M. Yannakakis
- Computer ScienceFormal Methods Syst. Des.
- 18 June 1990
Algorithms are presented that solve the emptiness problem without explicitly constructing the strongly connected components of the graph representing the product automaton by allowing the algorithms to err with some probability.
Weighted Round-Robin Cell Multiplexing in a General-Purpose ATM Switch Chip
- M. Katevenis, S. Sidiropoulos, C. Courcoubetis
- Computer ScienceIEEE J. Sel. Areas Commun.
- 1 October 1991
The authors present the architecture of a general-purpose broadband-ISDN (B-IS DN) switch chip and its novel feature: the weighted round-robin cell (packet) multiplexing algorithm and its implementation in hardware, thus proving the feasibility of the architecture.
Model-checking for real-time systems
- R. Alur, C. Courcoubetis, D. Dill
- Computer Science Proceedings. Fifth Annual IEEE Symposium on…
- 4 June 1990
An algorithm is developed for model checking, that is, for determining the truth of a TCTL formula with respect to a timed graph, and it is argued that choosing a dense domain, instead of a discrete domain, to model time does not blow up the complexity of the model-checking problem.
Peer-to-Peer Product Sharing: Implications for Ownership, Usage, and Social Welfare in the Sharing Economy
We describe an equilibrium model of peer-to-peer product sharing, or collaborative consumption, where individuals with varying usage levels make decisions about whether or not to own a homogeneous…
Pricing communication networks - economics, technology and modelling
This book discusses network services and contracts, pricing and communications networks, and competition models for constrained Optimization.
Distinguishing tests for nondeterministic and probabilistic machines
This work studies the problem of uniquely identifying the initial state of a given finite-state machine from among a set of possible choices, based on the input-output behavior, and provides optimal bounds for deciding whether such games have strategies winning with probability 1.