Untanglings: a novel approach to analyzing concurrent systems

DOI10.1007/S00165-014-0329-4zbMath1347.68272OpenAlexW2088752438MaRDI QIDQ903488

Artem Polyvyanyy, Marcello La Rosa, Chun Ouyang, Arthur H. M. ter Hofstede

Publication date: 6 January 2016

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11343/224173

zbMATH Keywords

concurrent systemsconcurrencyrepresentative untanglings

Mathematics Subject Classification ID

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

Uses Software

• jBPT

Cites Work

• Unnamed Item
• Models for concurrency: Towards a classification
• Merged processes: a new condensed representation of Petri net behaviour
• Partial order behaviour and structure of Petri nets
• Petri nets, event structures and domains. I
• The covering and boundedness problems for vector addition systems
• A technique of state space search based on unfolding
• An improvement of McMillan's unfolding algorithm
• Using partial orders for the efficient verification of deadlock freedom and safety properties
• Canonical prefixes of Petri net unfoldings
• Unfoldings: A partial-order approach to model checking.
• An Algorithm for Direct Construction of Complete Merged Processes
• The non-sequential behaviour of Petri nets
• Free Choice Petri Nets
• Understanding Petri Nets
• The 4C Spectrum of Fundamental Behavioral Relations for Concurrent Systems
• Contextual Merged Processes

This page was built for publication: Untanglings: a novel approach to analyzing concurrent systems