A conservative look at operational semantics with variable binding

DOI10.1006/inco.1998.2729zbMath0916.68098MaRDI QIDQ1273877

W. J. Fokkink, Chris Verhoef

Publication date: 6 January 1999

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/efa7ba4abd245de7e042a344f1a692bd4b0fa5f2

zbMATH Keywords

transition system specifications

Mathematics Subject Classification ID

68Q55: Semantics in the theory of computing

68Q60: Specification and verification (program logics, model checking, etc.)

Related Items

Variable binding operators in transition system specifications, Real time process algebra with time-dependent conditions, An axiomatic semantics for Esterel, Duplication of constants in process algebra, SOS formats and meta-theory: 20 years after, 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, Rooted branching bisimulation as a congruence

Uses Software

• Nuprl

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structural operational semantics for weak bisimulations
• Transition system specifications with negative premises
• Recursive process definitions with the state operator
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Higher-level synchronising devices in Meije-SCCS
• Substitution revisited
• Model theory.
• A calculus of mobile processes. II
• Structured operational semantics and bisimulation as a congruence
• A theory of communicating processes with value passing
• A fully abstract denotational model for higher-order processes
• The lazy lambda calculus in a concurrency scenario
• The algebra of timed processes, ATP: Theory and application
• A general conservative extension theorem in process algebras with inequalities
• An operational semantics for timed CSP
• Discrete time process algebra
• Proving congruence of bisimulation in functional programming languages
• \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
• An effective axiomatization for real time ACP
• Real time process algebra
• A lattice-theoretical fixpoint theorem and its applications
• Process Algebra
• The well-founded semantics for general logic programs
• Bisimulation can't be traced
• The meaning of negative premises in transition system specifications
• πI: A symmetric calculus based on internal mobility
• Axiomatising real-timed processes