TPAP

DOI10.1016/S1571-0661(04)80470-5zbMath1270.68212OpenAlexW1542249763MaRDI QIDQ2842574

Frédéric Boniol, Jérôme Ermont

Publication date: 15 August 2013

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

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80470-5

Mathematics Subject Classification ID

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

Resources in process algebra

Uses Software

• Uppaal

Cites Work

• A theory of timed automata
• The algebra of timed processes, ATP: Theory and application
• Time-abstracted bisimulation: Implicit specifications and decidability
• A process algebra of communicating shared resources with dense time and priorities
• Uppaal in a nutshell
• Real time process algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: TPAP