Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fairness
Choosing social laws for multi-agent systems: minimality and simplicity
Artificial Intelligence
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Alternating-time temporal logic
Journal of the ACM (JACM)
Concurrent Omega-Regular Games
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
On Multiplayer Non-Cooperative Games of Incomplete Information: Part 1 - Decision Algorithms
On Multiplayer Non-Cooperative Games of Incomplete Information: Part 1 - Decision Algorithms
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
Models and Temporal Logics for Timed Component Connectors
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Modeling component connectors in Reo by constraint automata
Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
Symbolic Model Checking for Channel-based Component Connectors
Electronic Notes in Theoretical Computer Science (ENTCS)
A lattice theory for solving games of imperfect information
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Synthesis of reo circuits for implementation of component-connector automata specifications
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
A Uniform Framework for Modeling and Verifying Components and Connectors
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
| Hi-index | 0.00 |
Constraint automata have been introduced to provide a compositional, operational semantics for the exogenous coordination language Reo, but they can also serve interface specification for components and an operational model for other coordination languages. Constraint automata have been used as basis for equivalence checking and model checking temporal logical properties. The main contribution of this paper is to reason about the local view and interaction and cooperation facilities of individual components or coalitions of components by means of a multi-player semantics for constraint automata. We introduce a temporal logic framework that combines classical features of alternating-time logic (ATL) for concurrent games with special operators to specify the observable data flow at the I/O-ports of components. Since constraint automata support any kind of synchronous and asynchronous peer-to-peer communication, the resulting game structure is non-standard and requires a series of nontrivial adaptations of the ATL model checking algorithm.