Model-checking process equivalences

DOI10.1016/j.tcs.2014.08.020zbMath1303.68085arXiv1210.2451OpenAlexW2034020594MaRDI QIDQ477208

Etienne Lozes, Manuel Vargas Guzmán, Martin Lange

Publication date: 2 December 2014

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

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

zbMATH Keywords

model-checkinghigher-order \(\mu\)-calculuspolyadic \(\mu\)-calculusprocess equivalence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 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 (5)

Interleaving isotactics -- an equivalence notion on behaviour abstractions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Encoding safety in \(\mathrm{CLL}_R\)

Cites Work

• CCS expressions, finite state processes, and three problems of equivalence
• Fair simulation
• Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus
• Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic
• The Complexity of Model Checking Higher-Order Fixpoint Logic
• CONCUR 2004 - Concurrency Theory
• Decidability of DPDA equivalence
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Model-checking process equivalences