An algebraic description of system behaviours
From MaRDI portal
Publication:1168736
DOI10.1016/0304-3975(82)90079-2zbMath0493.68049OpenAlexW2020156240MaRDI QIDQ1168736
Publication date: 1982
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(82)90079-2
discrete systemsconcurrency of processescondition-event systemspartial algebra of labelled partially ordered setsrelationships between processessets of processes generated by systems
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25) Theory of computing (68Q99)
Related Items
An algebra of processes, An extension of the notions of traces and of asynchronous automata, Concurrent transition systems, Calculi of net structures and sets are similar, Petri nets are monoids, Unifying Petri Nets with Restricted Occurrence Rule Using Partial Algebra, An algebraic characterization of independence of Petri net processes, Process languages and nets
Cites Work
