Unfoldings of Networks of Automata and their Application in Supervision Bartosz Grabiec INRIA, IRISA Campus de Beaulieu, FRennes, France

Source URL: pagesperso.lina.univ-nantes.fr

Symbolic Unfoldings For Networks of Timed Automata Franck Cassez1⋆ , Thomas Chatain2 and Claude Jard3 1 2 3

Source URL: pagesperso.lina.univ-nantes.fr

On Decidability of Prebisimulation for Timed Automata Shibashis Guha, Chinmay Narayan, S. Arun-Kumar Department of Computer Science and Engineering, Indian Institute of Technology, Delhi.

Source URL: www.cse.iitd.ernet.in

Seed Encoding with LFSRs and Cellular Automata Ahmad A. Al-Yamani and Edward J. McCluskey Center for Reliable Computing Stanford University, Stanford, CA {alyamani, ejm}@crc.stanford.edu

Source URL: crc.stanford.edu

Learning Probabilistic Automata: A Study In State DistinguishabilityI Borja Ballea,∗, Jorge Castroa , Ricard Gavald`aa a Departament de Llenguatges i Sistemes Inform`

Source URL: borjaballe.github.io

Deterministic Pushdown Automata and Unary Languages Giovanni Pighizzini Dipartimento di Informatica e Comunicazione Università degli Studi di Milano

Source URL: pighizzini.di.unimi.it

Automata for Service Contracts ? Davide Basile, Pierpaolo Degano, and Gian-Luigi Ferrari {basile,degano,giangi}@di.unipi.it

Source URL: imm.dtu.dk

• Finite automata
• Ancient Greek technology
• Automation
• Automaton
• Robotics

The Complexity of Intersecting Finite Automata Having Few Final States

Source URL: www7.in.tum.de

Combined Tractability of Query Evaluation via Tree Automata and Cycluits Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart Problem Evaluate Datalog queries tractably in parameterized combined complexity

Source URL: mikael-monet.net

Controlling probabilistic systems under partial observation an automata and verification perspective Nathalie Bertrand, Inria Rennes, France Uncertainty in Computation Workshop October 4th 2016, Simons Institute, Berkele

Source URL: people.rennes.inria.fr