Theoretical Computer Science
Dynamical Properties of Timed Automata
Discrete Event Dynamic Systems
Partial Order Reductions for Timed Systems
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Compositional and symbolic model-checking of real-time systems
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
On implementation of global concurrent systems with local asynchronous controllers
CONCUR 2005 - Concurrency Theory
A partial order semantics approach to the clock explosion problem of timed automata
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Distributed time-asynchronous automata
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Timed unfoldings for networks of timed automata
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Distributed event clock automata
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
A concurrency-preserving translation from time Petri nets to networks of timed automata
Formal Methods in System Design
Avoiding shared clocks in networks of timed automata
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Reachability of communicating timed processes
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Operational semantics of a domain specific language for real time musician---computer interaction
Discrete Event Dynamic Systems
Hi-index | 0.00 |
We propose a model of distributed timed systems where each component is a timed automaton with a set of local clocks that evolve at a rate independent of the clocks of the other components. A clock can be read by any component in the system, but it can only be reset by the automaton it belongs to.There are two natural semantics for such systems. The universalsemantics captures behaviors that hold under any choice of clock rates for the individual components. This is a natural choice when checking that a system always satisfies a positive specification. However, to check if a system avoids a negative specification, it is better to use the existentialsemantics--the set of behaviors that the system can possibly exhibit under some choice of clock rates.We show that the existential semantics always describes a regular set of behaviors. However, in the case of universal semantics, checking emptiness turns out to be undecidable. As an alternative to the universal semantics, we propose a reactivesemantics that allows us to check positive specifications and yet describes a regular set of behaviors.