Rule formats for determinism and idempotence
From MaRDI portal
Publication:433348
Recommendations
Cites work
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 4059362 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 794263 (Why is no real title available?)
- A Rule Format for Associativity
- A rule format for unit elements
- A structural approach to operational semantics
- A syntactic commutativity format for SOS
- Automata, Languages and Programming
- Determinacy \(\to\) (observation equivalence \(=\) trace equivalence)
- Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence)
- Foundations of Software Science and Computational Structures
- Process Algebra
- Process algebra for hybrid systems
- Process algebra for synchronous communication
- Process algebra with timing
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
- Rule formats for compositional non-interference properties
- Rule formats for determinism and idempotence
- SOS formats and meta-theory: 20 years after
- Semantics and expressiveness of ordered SOS
- Structural operational semantics and bounded nondeterminism
- Structural operational semantics with first-order logic
- Structural operational semantics.
- Structured operational semantics and bisimulation as a congruence
- The algebra of timed processes, ATP: Theory and application
- Transition system specifications with negative premises
- Turning SOS rules into equations
Cited in
(5)
This page was built for publication: Rule formats for determinism and idempotence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q433348)