Concurrent transition systems (Q1119395): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Ferucio Laurenţiu Ţiplea / rank | |||
Property / reviewed by | |||
Property / reviewed by: Ferucio Laurenţiu Ţiplea / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0304-3975(89)90050-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2060344461 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3711740 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4152697 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The lambda calculus, its syntax and semantics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimal and Optimal Computations of Recursive Programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3664417 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3321470 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Testing equivalences for processes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4079524 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3942370 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3738547 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5535414 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5682456 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Communicating sequential processes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4054644 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4138147 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4151149 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Formal verification of parallel programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3680240 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3713578 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4723281 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3707415 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4215784 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Functional behavior of nondeterministic and concurrent programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4733400 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A calculus of communicating systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3750113 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Petri nets, event structures and domains. I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3795195 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the termination of program schemas / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3042377 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3718143 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A fixpoint semantics for nondeterministic data flow / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Port automata and the algebra of concurrent porcesses / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3776635 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An algebraic description of system behaviours / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Behaviours of concurrent systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3030239 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Synchronization trees / rank | |||
Normal rank |
Latest revision as of 15:11, 19 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Concurrent transition systems |
scientific article |
Statements
Concurrent transition systems (English)
0 references
1989
0 references
The author was led to define concurrent transition systems (CTS for short) because of the apparent difficulty of establishing relationships between operational and denotational models of concurrent computation. A CTS is an ordinary nondeterministic transition system provided with additional concurrency information. This concurrency information is specified in terms of a binary residual operation on transitions, which describes how certain pairs of transitions ``commute''. The defining axioms for a CTS generate a rich algebraic theory, minutely developed. Each CTS C freely generates a complete CTS or computation category \(C^*\), whose arrows are equivalence classes of finite computation sequences modulo a congruence induced by the residual operation. The notion ``computation tree'' for ordinary transition systems generalized at computation diagram for CTS's, leading to computation convenient definition of a CTS as the ideals of its computation diagram. A pleasant property of this definition is that the notion of a maximal ideal in certain circumstances can serve as replacement for the most troublesome notion of a fair computation sequence. To illustrate CTS utility, the author use them to define and investigate a dataflow-like model of concurrent computation.
0 references
concurrent transition systems
0 references
CTS
0 references
complete CTS
0 references
computation category
0 references
computation diagram
0 references
maximal ideal
0 references
fair computation sequence
0 references