Reducing Quasi-Equal Clocks in Networks of Timed Automata

DOI10.1007/978-3-642-33365-1_12zbMath1374.68334OpenAlexW176004376MaRDI QIDQ4649393

Christian Herrera, Marco Muñiz, Andreas Podelski, Bernd Westphal, Sergio Feo-Arenis

Publication date: 21 November 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.704.8310

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

This page was built for publication: Reducing Quasi-Equal Clocks in Networks of Timed Automata