Occurrence Nets Then and Now: The Path to Structured Occurrence Nets

DOI10.1007/978-3-642-21834-7_1zbMath1330.68215OpenAlexW1841764564MaRDI QIDQ3011878

Brian Randell

Publication date: 29 June 2011

Published in: Applications and Theory of Petri Nets (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21834-7_1

zbMATH Keywords

errorsfaultsdeadlock avoidanceabstractionatomicityformal analysisjudgementfailure analysisfailuresdependabilityoccurrence nets

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) History of computer science (68-03)

Related Items

Localities in systems with a/sync communication

Uses Software

• Workcraft

Cites Work

• Verification of bounded Petri nets using integer programming
• The Merlin-Randell problem of train journeys
• A technique of state space search based on unfolding
• A formal model of atomicity in asynchronous systems
• Unfoldings: A partial-order approach to model checking.
• Structured Occurrence Nets: A Formalism for Aiding System Failure Prevention and Analysis Techniques
• Failures: Their Definition, Modelling and Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Occurrence Nets Then and Now: The Path to Structured Occurrence Nets