Transition systems without transitions

DOI10.1016/j.tcs.2004.09.026zbMath1078.68105OpenAlexW2034810414MaRDI QIDQ557786

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

Concurrency theory2-StructureElementary 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)

Cites Work

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

This page was built for publication: Transition systems without transitions