scientific article; zbMATH DE number 1759410

zbMath0996.68121MaRDI QIDQ4536359

Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit

Publication date: 4 November 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

Concurrency in timed automata ⋮ Updatable timed automata ⋮ Task automata: Schedulability, decidability and undecidability ⋮ Low dimensional hybrid systems -- decidable, undecidable, don't know ⋮ \(\varepsilon\)-transitions in concurrent timed automata ⋮ Removing All Silent Transitions from Timed Automata

Uses Software

• HyTech

This page was built for publication: