On recursive operations over logic LTS

DOI10.1017/S0960129514000073zbMath1362.68224arXiv1301.3350OpenAlexW2104105311MaRDI QIDQ5740660

Zhaohui Zhu, Jinjin Zhang, Yan Zhang

Publication date: 27 July 2016

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\) ⋮ Encoding safety in \(\mathrm{CLL}_R\)

Cites Work

• Unnamed Item
• Unnamed Item
• Safe reasoning with logic LTS
• Transition system specifications with negative premises
• Conjunction on processes: Full abstraction via ready-tree semantics
• Ready simulation for concurrency: it's logical!
• Calculi for synchrony and asynchrony
• A calculus of mobile processes. I
• A complete axiomatisation for observational congruence of finite-state behaviours
• A Logical Process Calculus
• Characteristic formulae for fixed-point semantics: a general framework
• A ground-complete axiomatisation of finite-state processes in a generic process algebra
• Process algebra for synchronous communication
• Bisimulation can't be traced
• The meaning of negative premises in transition system specifications

This page was built for publication: On recursive operations over logic LTS