CONCUR 2005 – Concurrency Theory

DOI10.1007/11539452zbMath1134.68384OpenAlexW1737342522MaRDI QIDQ5897477

Catalin Dima

Publication date: 1 November 2006

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

Full work available at URL: https://doi.org/10.1007/11539452

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 (3)

A survey of timed automata for the development of real-time systems ⋮ A study on shuffle, stopwatches and independently evolving clocks ⋮ Timed Basic Parallel Processes

This page was built for publication: CONCUR 2005 – Concurrency Theory