Variable binding operators in transition system specifications

DOI10.1016/S1567-8326(00)00003-5zbMath0970.68117WikidataQ127764184 ScholiaQ127764184MaRDI QIDQ5931555

C. A. Middelburg

Publication date: 21 October 2001

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

zbMATH Keywords

structural operational semanticstransition system specifications

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (11)

Continuity controlled hybrid automata ⋮ A format for semantic equivalence comparison ⋮ Duplication of constants in process algebra ⋮ Unnamed Item ⋮ SOS formats and meta-theory: 20 years after ⋮ An alternative formulation of operational conservativity with binding terms. ⋮ Notions of bisimulation and congruence formats for SOS with data ⋮ Real time process algebra with time-dependent conditions ⋮ Process algebra for hybrid systems ⋮ A congruence rule format for name-passing process calculi ⋮ Coverability Synthesis in Parametric Petri Nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transition system specifications with negative premises
• Higher-level synchronising devices in Meije-SCCS
• A calculus of mobile processes. II
• Structured operational semantics and bisimulation as a congruence
• A conservative look at operational semantics with variable binding
• An algebraic generalization of Frege structures -- binding algebras
• Combinatory reduction systems: Introduction and survey
• The algebra of timed processes, ATP: Theory and application
• A theory of higher order communicating systems
• A general conservative extension theorem in process algebras with inequalities
• A theory of bisimulation for the \(\pi\)-calculus
• Proving congruence of bisimulation in functional programming languages
• \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
• Real time process algebra
• A kripke-kleene semantics for logic programs*
• The Semantics of Predicate Logic as a Programming Language
• The well-founded semantics for general logic programs
• Logic programming and negation: A survey
• Bisimulation can't be traced
• The meaning of negative premises in transition system specifications

This page was built for publication: Variable binding operators in transition system specifications