Finite axiom systems for testing preorder and De Simone process languages
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 4056992 (Why is no real title available?)
- scientific article; zbMATH DE number 3744561 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 48630 (Why is no real title available?)
- scientific article; zbMATH DE number 177854 (Why is no real title available?)
- scientific article; zbMATH DE number 3995043 (Why is no real title available?)
- scientific article; zbMATH DE number 869193 (Why is no real title available?)
- A complete axiomatisation for observational congruence of finite-state behaviours
- A complete inference system for a class of regular behaviours
- Algebra of communicating processes with abstraction
- Bisimulation and divergence
- Bisimulation can't be traced
- CPO models for compact GSOS languages
- Extensional equivalences for transition systems
- Finite axiom systems for testing preorder and De Simone process languages
- Higher-level synchronising devices in Meije-SCCS
- Observation equivalence as a testing equivalence
- Ordered SOS process languages for branching and eager bisimulations
- Priorities in process algebras
- Process Algebra
- Process algebra for synchronous communication
- Structural operational semantics for weak bisimulations
- Structured operational semantics and bisimulation as a congruence
- Testing equivalences for processes
- Transition system specifications with negative premises
- Turning SOS rules into equations
Cited in
(11)- A precongruence format for should testing preorder
- SOS formats and meta-theory: 20 years after
- Finite axiom systems for testing preorder and De Simone process languages
- A syntactic commutativity format for SOS
- Generating priority rewrite systems for OSOS process languages
- Ordered SOS process languages for branching and eager bisimulations
- Axiomatizing GSOS with termination
- Automating soundness proofs
- Axiomatization of if-then-else over possibly non-halting programs and tests
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
- Ensuring liveness properties of distributed systems: open problems
This page was built for publication: Finite axiom systems for testing preorder and De Simone process languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575273)
