Failures: Their Definition, Modelling and Analysis

DOI10.1007/978-3-540-75292-9_18zbMath1147.68599OpenAlexW1699807655MaRDI QIDQ3525090

Brian Randell, Maciej Koutny

Publication date: 17 September 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-75292-9_18

zbMATH Keywords

errorsfaultsabstractionformal analysisjudgementfailuresdependabilityoccurrence nets

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Failures: Their Definition, Modelling and Analysis ⋮ Occurrence Nets Then and Now: The Path to Structured Occurrence Nets

Cites Work

• Unnamed Item
• Unnamed Item
• Process semantics of general inhibitor nets
• Verification of bounded Petri nets using integer programming
• Sequential and concurrent behaviour in Petri net theory
• A technique of state space search based on unfolding
• A formal model of atomicity in asynchronous systems
• Failures: Their Definition, Modelling and Analysis
• Formal Techniques for Networked and Distributed Systems – FORTE 2004

This page was built for publication: Failures: Their Definition, Modelling and Analysis