Transition systems without transitions

DOI10.1016/J.TCS.2004.09.026MaRDI QIDQ557786zbMATH OpenOpenAlexFDO

Authors Andrzej M. Borzyszkowski, Philippe Darondeau

Publication date 30 June 2005

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2004.09.026

zbMATH Keywords

2-StructureConcurrency theoryElementary netTransition system

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Transition systems
• An exercise on transition systems
• scientific article; zbMATH DE number 5068370
• Switching phenomena in a system with no switches
• scientific article; zbMATH DE number 6790161
• scientific article; zbMATH DE number 1107504
• Analysis of the structure of attributed transition systems without hidden transitions
• Elementary transition systems
• scientific article; zbMATH DE number 139604

Cites work

• An algebraic model of observable properties in distributed systems
• Elementary transition systems
• Partial (set) 2-structures. I: Basic notions and the representation problems
• Partial (set) 2-structures. II: State spaces of concurrent systems

Cited in

(1)

• Partial (set) 2-structures. I: Basic notions and the representation problems

This page was built for publication: Transition systems without transitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557786)