Rule formats for determinism and idempotence
From MaRDI portal
Publication:433348
DOI10.1016/j.scico.2010.04.002zbMath1243.68205OpenAlexW2110138205WikidataQ57745567 ScholiaQ57745567MaRDI QIDQ433348
Publication date: 13 July 2012
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.scico.2010.04.002
Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Event algebra for transition systems composition application to timed automata, Unnamed Item, SOS rule formats for idempotent terms and idempotent unary operators
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Transition system specifications with negative premises
- A syntactic commutativity format for SOS
- SOS formats and meta-theory: 20 years after
- Semantics and expressiveness of ordered SOS
- Determinacy \(\to\) (observation equivalence \(=\) trace equivalence)
- Structured operational semantics and bisimulation as a congruence
- Turning SOS rules into equations
- The algebra of timed processes, ATP: Theory and application
- Structural operational semantics and bounded nondeterminism
- Process algebra for hybrid systems
- Process algebra with timing
- Rule formats for compositional non-interference properties
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
- A structural approach to operational semantics
- Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence)
- Structural Operational Semantics with First-Order Logic
- Rule Formats for Determinism and Idempotence
- A Rule Format for Unit Elements
- A Rule Format for Associativity
- Process algebra for synchronous communication
- Process Algebra
- Foundations of Software Science and Computational Structures
- Automata, Languages and Programming
