Configuration- and Residual-Based Transition Systems for Event Structures with Asymmetric Conflict

DOI10.1007/978-3-319-51963-0_11zbMath1444.68113OpenAlexW2569377242MaRDI QIDQ2971130

Eike Best, I. B. Virbitskaite, Nataliya Gribovskaya

Publication date: 4 April 2017

Published in: SOFSEM 2017: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-51963-0_11

zbMATH Keywords

interleaving semanticslabelled transition systemsbisimilaritymultiset semanticsevent structures with asymmetric conflictpomset semantics

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Comparative Transition System Semantics for Cause-Respecting Reversible Prime Event Structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed probabilistic and quantum strategies
• Transition systems from event structures revisited
• Models for concurrency: Towards a classification
• On the nature of events: another perspective in concurrency
• Configuration structures, event structures and Petri nets
• Concurrency and atomicity
• Petri nets, event structures and domains. I
• Contextual Petri nets, asymmetric event structures, and processes
• Equilibria of concurrent games on event structures
• CONCUR 2003 - Concurrency Theory
• Refinement of actions and equivalence notions for concurrent systems

This page was built for publication: Configuration- and Residual-Based Transition Systems for Event Structures with Asymmetric Conflict