A conservative look at operational semantics with variable binding
From MaRDI portal
Recommendations
Cites work
- \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
- A calculus of mobile processes. II
- A fully abstract denotational model for higher-order processes
- A general conservative extension theorem in process algebras with inequalities
- A lattice-theoretical fixpoint theorem and its applications
- A theory of communicating processes with value passing
- An effective axiomatization for real time ACP
- An operational semantics for timed CSP
- Axiomatising real-timed processes
- Bisimulation can't be traced
- Discrete time process algebra
- Higher-level synchronising devices in Meije-SCCS
- scientific article; zbMATH DE number 4160107 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (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 48139 (Why is no real title available?)
- scientific article; zbMATH DE number 176736 (Why is no real title available?)
- scientific article; zbMATH DE number 400801 (Why is no real title available?)
- scientific article; zbMATH DE number 683363 (Why is no real title available?)
- scientific article; zbMATH DE number 2102773 (Why is no real title available?)
- scientific article; zbMATH DE number 794263 (Why is no real title available?)
- scientific article; zbMATH DE number 821282 (Why is no real title available?)
- Model theory.
- Process Algebra
- Proving congruence of bisimulation in functional programming languages
- Real time process algebra
- Recursive process definitions with the state operator
- Structural operational semantics for weak bisimulations
- Structured operational semantics and bisimulation as a congruence
- Substitution revisited
- The algebra of timed processes, ATP: Theory and application
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The lazy lambda calculus in a concurrency scenario
- The meaning of negative premises in transition system specifications
- The well-founded semantics for general logic programs
- Transition system specifications with negative premises
- πI: A symmetric calculus based on internal mobility
Cited in
(23)- A congruence rule format for name-passing process calculi
- A general conservative extension theorem in process algebras with inequalities
- An alternative formulation of operational conservativity with binding terms.
- Bisimilarity of open terms.
- Modular structural operational semantics
- A format for semantic equivalence comparison
- The abstract variable-binding calculus
- Rooted branching bisimulation as a congruence
- A general SOS theory for the specification of probabilistic transition systems
- Reasoning in Abella about structural operational semantics specifications
- Proving the validity of equations in GSOS languages using rule-matching bisimilarity
- scientific article; zbMATH DE number 1860682 (Why is no real title available?)
- Rule formats for nominal process calculi
- SOS rule formats for convex and abstract probabilistic bisimulations
- Rule formats for nominal process calculi
- Variable binding operators in transition system specifications
- Real time process algebra with time-dependent conditions
- An axiomatic semantics for Esterel
- A new approach to abstract syntax with variable binding
- Rooted branching bisimulation as a congruence for probabilistic transition systems
- Duplication of constants in process algebra
- SOS formats and meta-theory: 20 years after
- Lifting non-finite axiomatizability results to extensions of process algebras
This page was built for publication: A conservative look at operational semantics with variable binding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1273877)
