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

DOI10.1016/J.TCS.2018.01.015zbMATH Open1400.68139OpenAlexW2886034110WikidataQ129365027 ScholiaQ129365027MaRDI QIDQ1786565FDOQ1786565

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

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

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)

Cites Work

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

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)