An algebraic description of system behaviours
From MaRDI portal
Publication:1168736
DOI10.1016/0304-3975(82)90079-2zbMath0493.68049MaRDI 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 systems; concurrency of processes; condition-event systems; partial algebra of labelled partially ordered sets; relationships between processes; sets of processes generated by systems
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68N25: Theory of operating systems
68Q99: Theory of computing
Related Items
Unifying Petri Nets with Restricted Occurrence Rule Using Partial Algebra, Petri nets are monoids, An algebraic characterization of independence of Petri net processes, An algebra of processes, Concurrent transition systems, Process languages and nets, Calculi of net structures and sets are similar, An extension of the notions of traces and of asynchronous automata
Cites Work