Logic of transition systems (original) (raw)

Decidable first-order transition logics for PA-processes

Philippe Schnoebelen

Information and Computation, 2005

View PDFchevron_right

Reasoning about higher-order processes

Mads Dam

Lecture Notes in Computer Science, 1995

View PDFchevron_right

Finite Abstract Models for Deterministic Transition Systems: Fair Parallel Composition and Refinement-Preserving Logic

Farhad Arbab

View PDFchevron_right

An algebraic characterization of transition system equivalences

Anne Dicky

Information and Computation, 1989

View PDFchevron_right

On the decidability of process equivalences for the π-calculus

D. Cowan

Theoretical Computer Science, 1997

View PDFchevron_right

A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces

Luca Aceto

Mathematical Structures in Computer Science, 1998

View PDFchevron_right

Modal Logic, Transition Systems and Processes

Jan van Eijck

Journal of Logic and Computation, 1994

View PDFchevron_right

On the Unification of Process Semantics: Equational Semantics

DAVID DE FRUTOS ESCRIG

Electronic Notes in Theoretical Computer Science, 2009

View PDFchevron_right

Characteristic formulae for fixed-point semantics: a general framework

Luca Aceto

Mathematical Structures in Computer Science, 2012

View PDFchevron_right

A Logical Study of Distributed Transition Systems

Rohit J Parikh

Information and Computation, 1995

View PDFchevron_right

Decidability, behavioural equivalences and infinite transition graphs

Hans Hyttel

1991

View PDFchevron_right

A non-standard semantics for generating reduced transition systems

Nicoletta Francesco, Antonella Santone, gigliola vaglini

Lecture Notes in Computer Science, 1997

View PDFchevron_right

Mathematical foundations of programming semantics. Proceedings of the 11th conference (MFPS), Tulane Univ., New Orleans, LA, USA, March 29 - April 1, 1995

Austin Melton

View PDFchevron_right

Mathematical Foundations of Programming Semantics, 9th International Conference, New Orleans, LA, USA, April 7-10, 1993, Proceedings

Austin Melton

Mathematical Foundations of Programming Semantics, 1994

View PDFchevron_right

First-order μ -calculus over generic transition systems and applications to the situation calculus

Marco Montali

Information and Computation

View PDFchevron_right

Modular Semantics for Transition System Specifications with Negative Premises

Mohammadreza Mousavi

View PDFchevron_right

On the Unification of Process Semantics: Logical Semantics

David de Frutos-Escrig

Electronic Proceedings in Theoretical Computer Science, 2011

View PDFchevron_right

Observations on the Decidability of Transitions

Bernhard Thalheim

Lecture Notes in Computer Science, 2004

View PDFchevron_right

Toward an Infinitary Logic of Domains: Abramsky Logic for Transition Systems

Marcello Bonsangue

Information and Computation, 1999

View PDFchevron_right

On the axiomatizability of priority II

Luca Aceto

Theoretical Computer Science, 2011

View PDFchevron_right

Transition systems, infinitary languages and the semantics of uniform concurrency

Jeff Zucker

1985

View PDFchevron_right

Towards a Generic Tool for Reasoning about Labeled Transition Systems

Davy Rouillard

View PDFchevron_right

Mathematical Foundations of Programming Semantics, 7th International Conference, Pittsburgh, PA, USA, March 25-28, 1991, Proceedings

Austin Melton

Mathematical Foundations of Programming Semantics, 1992

View PDFchevron_right

Towards a Logic of Morphisms and Sequential Programs

Sunny Suen

1995

View PDFchevron_right

Labelled transition logic: an outline

Egidio Astesiano

Acta Informatica, 2001

View PDFchevron_right

Mathematical Foundations of Programming Semantics, 5th International Conference, Tulane University, New Orleans, Louisiana, USA, March 29 - April 1, 1989, Proceedings

Austin Melton

View PDFchevron_right

An Epistemic Logic for Labelled Transition Systems

Prakash Panangaden

2011

View PDFchevron_right

Computation Paths Logic: An Expressive, yet Elementary, Process Logic

Eli Singerman

1997

View PDFchevron_right

Equivalence of recursive specifications in process algebra

Alban Ponse

Information Processing Letters, 2001

View PDFchevron_right

Arithmetical axiomatization of first-order temporal logic

Andrzej Szałas

Information Processing Letters, 1987

View PDFchevron_right

Priority and abstraction in process algebra

Ivan Christoff Christoff

Foundation of Software …, 1994

View PDFchevron_right

Finite equational bases in process algebra: Results and open questions

Wan Fokkink

Processes, Terms and Cycles: Steps on the Road to Infinity, 2005

View PDFchevron_right

On the Modal Definability of Simulability by Finite Transitive Models

David Duque

Studia Logica - An International Journal for Symbolic Logic, 2011

View PDFchevron_right

Equivalences and preorders of transition systems

Anne Dicky

Lecture Notes in Computer Science, 1993

View PDFchevron_right