Schedulers and Finishers: On Generating the Behaviours of an Event Structure

DOI10.1007/978-3-319-46750-4_8zbMath1400.68138OpenAlexW2521163036MaRDI QIDQ3179396

Georg Struth, Tahiry Rabehaja, Annabelle McIver

Publication date: 21 December 2016

Published in: Theoretical Aspects of Computing – ICTAC 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-46750-4_8

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Schedulers and finishers: on generating and filtering the behaviours of an event structure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic rely-guarantee calculus
• Concurrent Kleene algebra and its foundations
• Configuration structures, event structures and Petri nets
• Modeling concurrency with partial orders
• The equational theory of pomsets
• A calculus of communicating systems
• Petri nets, event structures and domains. I
• Infinite executions of lazy and strict computations
• Probabilistic event structures and domains
• An Event Structure Model for Probabilistic Concurrent Kleene Algebra
• Axioms for memory access in asynchronous hardware systems
• A Theory of Communicating Sequential Processes
• Time, clocks, and the ordering of events in a distributed system
• Communicating sequential processes

This page was built for publication: Schedulers and Finishers: On Generating the Behaviours of an Event Structure