Concurrent transition systems

DOI10.1016/0304-3975(89)90050-9zbMath0671.68027MaRDI QIDQ1119395

Eugene W. Stark

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90050-9

zbMATH Keywords

maximal ideal; concurrent transition systems; complete CTS; computation category; computation diagram; CTS; fair computation sequence

Mathematics Subject Classification ID

68Q70: Algebraic theory of languages and automata

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

18B20: Categories of machines, automata

Related Items

Models and logics for true concurrency., Models for concurrency: Towards a classification, Recognizable languages in concurrency monoids, Conditional rewriting logic as a unified model of concurrency, The expressive power of indeterminate dataflow primitives, Nonexpressibility of fairness and signaling, Labelled domains and automata with concurrency, Petri nets, traces, and local model checking, Relating conflict-free stable transition and event models via redex families, On the expressiveness of higher dimensional automata, Algebraic topology and concurrency, The conflict-free reduction geometry

Cites Work

• Port automata and the algebra of concurrent porcesses
• Behaviours of concurrent systems
• A calculus of communicating systems
• Petri nets, event structures and domains. I
• The lambda calculus, its syntax and semantics
• An algebraic description of system behaviours
• Synchronization trees
• Testing equivalences for processes
• Functional behavior of nondeterministic and concurrent programs
• A fixpoint semantics for nondeterministic data flow
• On the termination of program schemas
• Formal verification of parallel programs
• Communicating sequential processes
• Minimal and Optimal Computations of Recursive Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item