Temporal predicate transition nets—a new formalism for specifying and verifying concurrent systems (Q4032915): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207169208804127 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017513308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating predicate transition nets with first order temporal logic in the specification and verification of concurrent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: System modelling with high-level Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof System for Communicating Sequential Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonclausal deduction in first-order temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order modal tableaux / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Liveness Properties of Concurrent Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ``Hoare Logic'' of CSP, and All That / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adequate proof principles for invariance and liveness properties of concurrent programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on atomicity in distributed algorithms / rank
 
Normal rank

Latest revision as of 16:00, 17 May 2024

scientific article
Language Label Description Also known as
English
Temporal predicate transition nets—a new formalism for specifying and verifying concurrent systems
scientific article

    Statements

    Temporal predicate transition nets—a new formalism for specifying and verifying concurrent systems (English)
    0 references
    0 references
    16 May 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    high-level Petri nets
    0 references
    predicate transition nets
    0 references
    temporal logic
    0 references
    specification
    0 references
    verification
    0 references
    dining philosophers problem
    0 references
    0 references