A Noninterleaving Model of Concurrency Based on Transition Systems with Spatial Structure

Authors:
Luís Monteiro
Affiliations:
Departamento de Informática, Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2004

Citing 7
Cited 2

Models for concurrency

Handbook of logic in computer science (vol. 4)
Anytime, anywhere: modal logics for mobile ambients

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
Universal coalgebra: a theory of systems

Theoretical Computer Science - Modern algebra and its applications
Communication and Concurrency

Communication and Concurrency
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A spatial logic for concurrency (part I)

Information and Computation - TACS 2001

Modular Games for Coalgebraic Fixed Point Logics

Electronic Notes in Theoretical Computer Science (ENTCS)
Bialgebraic methods and modal logic in structural operational semantics

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In an attempt to devise a general notion of model for spatial logic, we have been led to consider transition systems with an additional so-called spatial structure on the states, with both the tran- sition and the spatial structures described in coalgebraic terms. In this paper we argue that such transition systems with spatial structure can be seen as a noninterleaving model of concurrency, by providing translations to and from a certain category of Petri nets.