Sequential value passing yields a Kleene theorem for processes
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1231655 (Why is no real title available?)
- scientific article; zbMATH DE number 794263 (Why is no real title available?)
- A characterization of regular expressions under bisimulation
- A complete inference system for a class of regular behaviours
- Branching time and abstraction in bisimulation semantics
- Expressiveness modulo bisimilarity of regular expressions with parallel composition
- Nested-unit Petri nets: a structural means to increase efficiency and scalability of verification on elementary nets
- Proceedings of the combined 27th international workshop on expressiveness in concurrency and the 17th workshop on structural operational semantics, EXPRESS/SOS 2020, online, August 31, 2020
- Process algebra with guards: Combining hoare logic with process algebra
- Process algebra with propositional signals
- Process algebra with recursive operations
- Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
- Pushdown Automata and Context-Free Grammars in Bisimulation Semantics
- Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity
- Sequential composition in the presence of intermediate termination (extended abstract)
- Structural operational semantics.
- The meaning of negative premises in transition system specifications
- The meaning of negative premises in transition system specifications. II
- Transition system specifications with negative premises
- When is partial trace equivalence adequate?
This page was built for publication: Sequential value passing yields a Kleene theorem for processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030793)
