The meaning of negative premises in transition system specifications. II

DOI10.1016/j.jlap.2004.03.007zbMath1072.68075OpenAlexW2109146692MaRDI QIDQ1878713

Robert J. van Glabbeek

Publication date: 8 September 2004

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

Full work available at URL: https://doi.org/10.1016/j.jlap.2004.03.007

zbMATH Keywords

specificationtransition systemssemantics for logic programs

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) Logic programming (68N17)

Related Items (25)

Pushdown Automata and Context-Free Grammars in Bisimulation Semantics ⋮ Compositionality of Hennessy-Milner logic by structural operational semantics ⋮ A syntactic commutativity format for SOS ⋮ A general SOS theory for the specification of probabilistic transition systems ⋮ A Pre-congruence Format for XY-simulation ⋮ Structural congruence for bialgebraic semantics ⋮ SOS formats and meta-theory: 20 years after ⋮ Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity ⋮ Compositional equivalences based on open pNets ⋮ Lang-n-Send Extended: Sending Regular Expressions to Monitors ⋮ Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity ⋮ Reactive bisimulation semantics for a process algebra with timeouts ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity ⋮ Some undecidable properties of SOS specifications ⋮ Notions of bisimulation and congruence formats for SOS with data ⋮ Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes ⋮ Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence ⋮ Unnamed Item ⋮ Semantics and expressiveness of ordered SOS ⋮ Divide and congruence III: Stability & divergence ⋮ Non Expansive ε-Bisimulations ⋮ A Congruence Rule Format with Universal Quantification

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transition system specifications with negative premises
• Structured operational semantics and bisimulation as a congruence
• \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
• 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: The meaning of negative premises in transition system specifications. II