Concurrent Machines
From MaRDI portal
Publication:3691067
DOI10.1093/comjnl/28.5.449zbMath0573.68026OpenAlexW4241072267MaRDI QIDQ3691067
Publication date: 1985
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/28.5.449
Related Items
History-preserving bisimilarity for higher-dimensional automata via open maps ⋮ Labelled domains and automata with concurrency ⋮ Transformations of sequential specifications into concurrent specifications by synchronization guards ⋮ Languages of higher-dimensional automata ⋮ Models for name-passing processes: Interleaving and causal ⋮ Unnamed Item ⋮ Concurrency and atomicity ⋮ Petri nets, traces, and local model checking ⋮ First-order axioms for asynchrony ⋮ Comparing transition systems with independence and asynchronous transition systems ⋮ A stable non-interleaving early operational semantics for the pi-calculus ⋮ From domains to automata with concurrency ⋮ A kleene theorem for recognizable languages over concurrency monoids ⋮ Executions: A new partial-order semantics of Petri nets ⋮ Event structures and trace monoids ⋮ Adequacy-preserving transformations of COSY path programs ⋮ Models for concurrency: Towards a classification ⋮ Recognizable languages in concurrency monoids ⋮ Petri nets and bisimulation ⋮ Structure of concurrency ⋮ The poset of infinitary traces ⋮ Multitraces, hypertraces and partial order semantics ⋮ A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus ⋮ Formal Relationships Between Geometrical and Classical Models for Concurrency ⋮ On the expressiveness of higher dimensional automata ⋮ Event-based functional decomposition ⋮ Stable trace automata vs. full trace automata ⋮ An algebraic characterization of independence of Petri net processes ⋮ Petri nets, traces, and local model checking ⋮ Algebraic Structure of Step Traces and Interval Traces ⋮ RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA
