Reachability of Communicating Timed Processes

DOI10.1007/978-3-642-37075-5_6zbMath1260.68262arXiv1209.0571OpenAlexW1790982954MaRDI QIDQ4910413

Amélie Stainer, Lorenzo Clemente, Frédéric Herbreteau, Grégoire Sutre

Publication date: 18 March 2013

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

Full work available at URL: https://arxiv.org/abs/1209.0571

Mathematics Subject Classification ID

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

Related Items (4)

Timed Basic Parallel Processes ⋮ Progress-preserving Refinements of CTA ⋮ Combining free choice and time in Petri nets ⋮ Decidable Classes of Unbounded Petri Nets with Time and Urgency

This page was built for publication: Reachability of Communicating Timed Processes