On the complexity of equation solving in process algebra
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
Interconnecting formalisms: supporting modularity, reuse and incrementality
SIGSOFT '95 Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering
Event-clock automata: a determinizable class of timed automata
Theoretical Computer Science
Communicating sequential processes
Communications of the ACM
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Alternating-time temporal logic
Journal of the ACM (JACM)
A Constraint Oriented Proof Methodology Based on Modal Transition Systems
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
Synchronous and Bidirectional Component Interfaces
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Timed Modal Specification - Theory and Tools
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Presheaf models for CCS-like languages
Theoretical Computer Science
Interconnecting Objects via Contracts
TOOLS '01 Proceedings of the Technology of Object-Oriented Languages and Systems
Games for synthesis of controllers with partial observation
Theoretical Computer Science - Logic and complexity in computer science
Profunctors, open maps and bisimulation
Mathematical Structures in Computer Science
Composition for component-based modeling
Science of Computer Programming - Formal methods for components and objects pragmatic aspects and applications
Modal Specifications for the Control Theory of Discrete Event Systems
Discrete Event Dynamic Systems
Residual for Component Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
Interface theories with component reuse
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Refinement and Consistency of Timed Modal Specifications
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Modal interfaces: unifying interface automata and modal specifications
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
Why Are Modalities Good for Interface Theories?
ACSD '09 Proceedings of the 2009 Ninth International Conference on Application of Concurrency to System Design
A Compositional Approach on Modal Specifications for Timed Systems
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Timed I/O automata: a complete specification theory for real-time systems
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Modal I/O automata for interface and product line theories
ESOP'07 Proceedings of the 16th European conference on Programming
UPPAAL-Tiga: time for playing games!
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Synthesis of interface automata
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
The embedded systems design challenge
FM'06 Proceedings of the 14th international conference on Formal Methods
On modal refinement and consistency
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |
Modal specifications are classic, convenient, and expressive mathematical objects to represent interfaces of component-based systems. However, time is a crucial aspect of systems for practical applications, e.g. in the area of embedded systems. And yet, only few results exist on the design of timed component-based systems. In this paper, we propose a timed extension of modal specifications, together with fundamental operations (conjunction, product, and quotient) that enable reasoning in a compositional way about timed system. The specifications are given as modal event-clock automata, where clock resets are easy to handle. We develop an entire theory that promotes efficient incremental design techniques.