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
Event-clock automata: a determinizable class of timed automata
Theoretical Computer Science
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)
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
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
Games for synthesis of controllers with partial observation
Theoretical Computer Science - Logic and complexity in computer science
Modal Specifications for the Control Theory of Discrete Event Systems
Discrete Event Dynamic Systems
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
Why Are Modalities Good for Interface Theories?
ACSD '09 Proceedings of the 2009 Ninth International Conference on Application of Concurrency to System Design
Modal I/O automata for interface and product line theories
ESOP'07 Proceedings of the 16th European conference on Programming
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
Methodologies for specification of real-time systems using timed I/O automata
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
Vision paper: make a difference! (semantically)
Proceedings of the 14th international conference on Model driven engineering languages and systems
Refinement and asynchronous composition of modal petri nets
Transactions on Petri Nets and Other Models of Concurrency V
Moving from specifications to contracts in component-based design
FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
Modal event-clock specifications for timed component-based design
Science of Computer Programming
A Modal Interface Theory for Component-based Design
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
Revisiting timed specification theories: a linear-time perspective
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
On the one hand, modal specifications are classic, convenient, and expressive mathematical objects to represent interfaces of component-based systems. On the other hand, 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 to reason 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.