CONCUR 2004 - Concurrency Theory

DOI10.1007/b100113zbMath1099.03022OpenAlexW2499482941MaRDI QIDQ5311496

Ramesh Viswanathan, Mahesh Viswanathan

Publication date: 23 August 2005

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

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

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (16)

Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic ⋮ The tail-recursive fragment of timed recursive CTL ⋮ On higher-order reachability games vs may reachability ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Model-checking process equivalences ⋮ Predicate abstraction and CEGAR for \(\nu \mathrm{HFL}_\mathbb{Z}\) validity checking ⋮ Temporal Logic with Recursion. ⋮ Temporal logics with language parameters ⋮ Three notes on the complexity of model checking fixpoint logic with chop ⋮ Temporal logic with recursion ⋮ The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic ⋮ Local higher-order fixpoint iteration

This page was built for publication: CONCUR 2004 - Concurrency Theory