Concurrent transition systems

DOI10.1016/0304-3975(89)90050-9zbMath0671.68027OpenAlexW2060344461MaRDI 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 idealconcurrent transition systemscomplete CTScomputation categorycomputation diagramCTSfair computation sequence

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categories of machines, automata (18B20)

Related Items (29)

Connections between a concrete and an abstract model of concurrent systems ⋮ Labelled domains and automata with concurrency ⋮ The geometry of orthogonal reduction spaces ⋮ The true concurrency of differential interaction nets ⋮ Compositional relational semantics for indeterminate dataflow networks ⋮ On relating rewriting systems and graph grammars to event structures ⋮ Petri nets, traces, and local model checking ⋮ On continuous time agents ⋮ Decomposition Theorems for Bounded Persistent Petri Nets ⋮ Towards automata for branching time and partial order ⋮ Mind the gap: expanding communication options in decentralized discrete-event control ⋮ Unnamed Item ⋮ From domains to automata with concurrency ⋮ A kleene theorem for recognizable languages over concurrency monoids ⋮ 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 ⋮ On the expressiveness of higher dimensional automata ⋮ Algebraic topology and concurrency ⋮ Models and logics for true concurrency. ⋮ Proof-relevant π-calculus: a constructive account of concurrency and causality ⋮ Petri nets, traces, and local model checking ⋮ Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets ⋮ Nonexpressibility of fairness and signaling ⋮ The conflict-free reduction geometry ⋮ Directed Homotopy in Non-Positively Curved Spaces ⋮ Relating conflict-free stable transition and event models via redex families ⋮ Relative normalization in Deterministic Residual Structures

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

This page was built for publication: Concurrent transition systems