An algebraic characterisation of elementary net system (observable) state space
From MaRDI portal
Publication:1203118
DOI10.1007/BF03180565zbMath0758.68050OpenAlexW2031298472MaRDI QIDQ1203118
Publication date: 4 February 1993
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03180565
equivalenceabstractionmorphismspreorderstate spaceelementary net systemlocal state transformation algebrastate observability
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Partial (set) 2-structures. II: State spaces of concurrent systems
- Petri nets are monoids
- Petri nets: central models and their properties. Advances in Petri nets 1986, Part I. Proceedings of an advanced course, Bad Honnef, September 8--19, 1986
- Concurrent histories: a basis for observing distributed systems
- Petri nets, algebras, morphisms, and compositionality
- A calculus of communicating systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An algebraic characterisation of elementary net system (observable) state space