English

A Hybrid Linear Logic for Constrained Transition Systems

Logic in Computer Science 2016-03-09 v1

Abstract

Linear implication can represent state transitions, but real transition systems operate under temporal, stochastic or probabilistic constraints that are not directly representable in ordinary linear logic. We propose a general modal extension of intuitionistic linear logic where logical truth is indexed by constraints and hybrid connectives combine constraint reasoning with logical reasoning. The logic has a focused cut-free sequent calculus that can be used to internalize the rules of particular constrained transition systems; we illustrate this with an adequate encoding of the synchronous stochastic pi-calculus.

Keywords

Cite

@article{arxiv.1603.02641,
  title  = {A Hybrid Linear Logic for Constrained Transition Systems},
  author = {Joelle Despeyroux and Kaustuv Chaudhuri},
  journal= {arXiv preprint arXiv:1603.02641},
  year   = {2016}
}

Comments

LIPIcs. TYPES'2013, Apr 2013, Toulouse, France. Post-proceedings of TYPES'2013, 19th Intl Conference on Types for Proofs and Programs, LIPIcs., 26, pp.150-168, 2014. arXiv admin note: substantial text overlap with arXiv:1310.4310

R2 v1 2026-06-22T13:06:42.552Z