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

DOI10.1016/j.tcs.2018.01.015zbMath1400.68139OpenAlexW2886034110WikidataQ129365027 ScholiaQ129365027MaRDI QIDQ1786565

Tahiry Rabehaja, Georg Struth, Annabelle McIver

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

completenesspartial orderconcurrencyspecificationevent 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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Petri nets, event structures and domains. I
• Axiomatizing the subsumption and subword preorders on finite and infinite partial words
• Probabilistic event structures and domains
• An Event Structure Model for Probabilistic Concurrent Kleene Algebra
• Schedulers and Finishers: On Generating the Behaviours of an Event Structure
• Axioms for memory access in asynchronous hardware systems
• A Theory of Communicating Sequential Processes
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Time, clocks, and the ordering of events in a distributed system
• Communicating sequential processes