Connections between a concrete and an abstract model of concurrent systems

DOI10.1007/BFb0040254MaRDI QIDQ5887511

Eugene W. Stark

Publication date: 12 April 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

prime intervalconcurrent systemtrace theoryfull subcategorycomputation sequence

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (11)

Labelled domains and automata with concurrency ⋮ On relating rewriting systems and graph grammars to event structures ⋮ A counterexample to Thiagarajan's conjecture on regular event structures ⋮ Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra ⋮ From domains to automata with concurrency ⋮ A kleene theorem for recognizable languages over concurrency monoids ⋮ Recognizable languages in concurrency monoids ⋮ Representation of computations in concurrent automata by dependence orders ⋮ Stable trace automata vs. full trace automata ⋮ Context-free event domains are recognizable ⋮ Context-free event domains are recognizable

Cites Work

• Theory of traces
• Concurrent transition systems
• A proof of the Kahn principle for input/output automata
• Minimal and Optimal Computations of Recursive Programs
• Compositional relational semantics for indeterminate dataflow networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Connections between a concrete and an abstract model of concurrent systems