scientific article; zbMATH DE number 2080757

zbMath1050.68518MaRDI QIDQ4473719

Luca de Alfaro, Thomas A. Henzinger

Publication date: 4 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2211/22110148.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (39)

Building a Modal Interface Theory for Concurrency and Data ⋮ The Complexity of Synthesis from Probabilistic Components ⋮ Generalized interface automata with multicast synchronization ⋮ Graph Games and Reactive Synthesis ⋮ Admissible Strategies in Infinite Games over Graphs ⋮ Theory and methodology of assumption/commitment based system interface specification and architectural contracts ⋮ Sequential Relational Decomposition ⋮ The refinement calculus of reactive systems ⋮ An interface theory for service-oriented design ⋮ From interface automata to hypercontracts ⋮ Randomness for free ⋮ A survey of stochastic \(\omega \)-regular games ⋮ Unnamed Item ⋮ A bandwidth allocation scheme for compositional real-time systems with periodic resources ⋮ Threaded behavior protocols ⋮ Integration of categorical frameworks: Rule-based refinement and hierarchical composition for components ⋮ A Modal Interface Theory with Data Constraints ⋮ Session coalgebras: a coalgebraic view on session types and communication protocols ⋮ Conditions of contracts for separating responsibilities in heterogeneous systems ⋮ Synthesis from component libraries with costs ⋮ A survey of partial-observation stochastic parity games ⋮ Strategy synthesis for multi-dimensional quantitative objectives ⋮ Assembly Theories for Communication-Safe Component Systems ⋮ Feedback in Synchronous Relational Interfaces ⋮ Contexts, refinement and determinism ⋮ Interface theories for concurrency and data ⋮ Using the compatibility analysis of logical specifications of automata to solve game problems ⋮ Encapsulating deontic and branching time specifications ⋮ Multi-level hierarchical interface-based supervisory control ⋮ Partial Order Reduction for State/Event LTL ⋮ Toward an algebraic theory of systems ⋮ Automated Synthesis of Application-Layer Connectors from Automata-Based Specifications ⋮ Formal verification of safety protocol in train control system ⋮ Modeling and Specification of Real-Time Interfaces with UTP ⋮ A semantic model for interacting cyber-physical systems ⋮ Moving from interface theories to assembly theories ⋮ Unnamed Item ⋮ A Formal Framework for Interactive Agents ⋮ Richer interface automata with optimistic and pessimistic compatibility

This page was built for publication: