A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994. ,
DOI : 10.1016/0304-3975(94)90010-8
Models and temporal logics for timed component connectors, Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004., pp.198-207, 2004. ,
DOI : 10.1109/SEFM.2004.1347521
URL : https://ir.cwi.nl/pub/4018/04018D.pdf
Modeling component connectors in Reo by constraint automata, Science of Computer Programming, vol.61, issue.2, pp.75-113, 2006. ,
DOI : 10.1016/j.scico.2005.10.008
Scheduling Games for Concurrent Systems, Proc. of COORDINATION, pp.84-100, 2016. ,
DOI : 10.1007/3-540-45937-5_14
URL : https://hal.archives-ouvertes.fr/hal-01631719
Handbook of weighted automata, 2009. ,
DOI : 10.1007/978-3-642-01492-5
URL : https://doi.org/10.1016/j.tcs.2007.02.055
On the expressiveness of higher dimensional automata, Theoretical Computer Science, vol.356, issue.3, pp.265-290, 1991. ,
DOI : 10.1016/j.tcs.2006.02.012
The Difference between Splitting innandn+1, Information and Computation, vol.136, issue.2, pp.109-142, 1997. ,
DOI : 10.1006/inco.1997.2634
Homology of higher dimensional automata, International Conference on Concurrency Theory, pp.254-268, 1992. ,
DOI : 10.1007/BFb0084796
Homotopy and concurrency, Current Trends in Theoretical Computer Science, pp.447-459, 2001. ,
The theory of hybrid automata In: Verification of Digital and Hybrid Systems, pp.265-292, 2000. ,
Decomposing port automata, Proceedings of the 2009 ACM symposium on Applied Computing, SAC '09, pp.1369-1373, 2009. ,
DOI : 10.1145/1529282.1529587
Communication and concurrency, 1989. ,
Modeling concurrency with geometry, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '91, pp.311-322, 1991. ,
DOI : 10.1145/99583.99625
URL : http://boole.stanford.edu/pub/cg.pdf