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

DOI10.1016/J.TCS.2018.01.015MaRDI QIDQ1786565zbMATHOpenAlexWikidataFDO

Authors Annabelle McIver, Tahiry Rabehaja, Georg Struth

Publication date 24 September 2018

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2018.01.015

zbMATH Keywords

partial ordercompletenessconcurrencyspecificationevent structure

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)

Recommendations

• Schedulers and finishers: on generating the behaviours of an event structure
• Simultaneity in event structures
• scientific article; zbMATH DE number 4182807
• Event fairness and non-interleaving concurrency
• scientific article; zbMATH DE number 4119660

Cites work

• scientific article; zbMATH DE number 3821120 (Why is no real title available?)
• scientific article; zbMATH DE number 3660783 (Why is no real title available?)
• scientific article; zbMATH DE number 3735177 (Why is no real title available?)
• scientific article; zbMATH DE number 70113 (Why is no real title available?)
• scientific article; zbMATH DE number 605806 (Why is no real title available?)
• scientific article; zbMATH DE number 3103212 (Why is no real title available?)
• A Theory of Communicating Sequential Processes
• An event structure model for probabilistic concurrent Kleene algebra
• Axiomatizing the subsumption and subword preorders on finite and infinite partial words
• Axioms for memory access in asynchronous hardware systems
• Communicating sequential processes
• Concurrent Kleene algebra and its foundations
• Configuration structures, event structures and Petri nets
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Modeling concurrency with partial orders
• Petri nets, event structures and domains. I
• Probabilistic event structures and domains
• Probabilistic rely-guarantee calculus
• Reverse bisimulations on stable configuration structures
• Schedulers and finishers: on generating the behaviours of an event structure
• The equational theory of pomsets
• Time, clocks, and the ordering of events in a distributed system

Cited in

(1)

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

This page was built for publication: Schedulers and finishers: on generating and filtering the behaviours of an event structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1786565)