Transition system specifications with negative premises

DOI10.1016/0304-3975(93)90111-6zbMATH Open0778.68057OpenAlexW2125382028MaRDI QIDQ685387FDOQ685387

Jan Friso Groote

Publication date: 9 January 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/194

zbMATH Keywords

stratificationmodularitycongruencefull abstractionbisimulationcompositionalitylabeled transition systemsnegative conditionsntyft/ntxyft-formatstructures operational semanticsTransition System Specifications

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Esterel synchronous programming language: Design, semantics, implementation
• Higher-level synchronising devices in Meije-SCCS
• Structured operational semantics and bisimulation as a congruence
• Algebraic laws for nondeterminism and concurrency
• Bisimulation can't be traced
• Calculi for synchrony and asynchrony
• Bisimulation through probabilistic testing
• A calculus of communicating systems
• Observation equivalence as a testing equivalence
• Algèbre de processus et synchronisation
• Global renaming operators in concrete process algebra

Cited In (65)

• Modal and temporal logics for processes
• Title not available (Why is that?)
• Back to the format: a survey on SOS for probabilistic processes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity
• Compositional equivalences based on open pNets
• Reactive bisimulation semantics for a process algebra with timeouts
• Pushdown Automata and Context-Free Grammars in Bisimulation Semantics
• Probabilistic divide \& congruence: branching bisimilarity
• Process algebra with four-valued logic
• Reduction semantics in Markovian process algebra
• A Pre-congruence Format for XY-simulation
• A process algebraic view of shared dataspace coordination
• Title not available (Why is that?)
• Structural operational semantics for weak bisimulations
• Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity
• A precongruence format for should testing preorder
• Algebraic theory of probabilistic and nondeterministic processes.
• SOS formats and meta-theory: 20 years after
• Title not available (Why is that?)
• Finite axiom systems for testing preorder and De Simone process languages
• A conservative look at operational semantics with variable binding
• Structured operational semantics and bisimulation as a congruence
• Discrete time generative-reactive probabilistic processes with different advancing speeds
• Variable binding operators in transition system specifications
• Rule formats for determinism and idempotence
• Quantales, finite observations and strong bisimulation
• Divide and congruence III: Stability & divergence
• A syntactic commutativity format for SOS
• Bochvar-McCarthy logic and process algebra
• Branching vs. Linear Time: Semantical Perspective
• Process algebra and conditional composition
• The theory of interactive generalized semi-Markov processes
• Semantics and expressiveness of ordered SOS
• Ordered SOS process languages for branching and eager bisimulations
• Comparing three semantics for Linda-like languages
• Rooted branching bisimulation as a congruence
• Sequent calculi for default and autoepistemic logics
• An alternative formulation of operational conservativity with binding terms.
• Notions of bisimulation and congruence formats for SOS with data
• A general conservative extension theorem in process algebras with inequalities
• Absolute versus relative time in process algebras.
• Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
• Compositionality of Hennessy-Milner logic by structural operational semantics
• On recursive operations over logic LTS
• Bialgebraic foundations for the operational semantics of string diagrams
• Barbed bisimulation
• A format for semantic equivalence comparison
• On the expressiveness of Linda coordination primitives.
• Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
• Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity
• A unified rule format for bounded nondeterminism in SOS with terms as labels
• A process algebraic view of Linda coordination primitives
• A comparison of Statecharts step semantics
• Title not available (Why is that?)
• On the axiomatisability of priority. III: Priority strikes again
• Structural operational semantics with first-order logic
• Some undecidable properties of SOS specifications
• A congruence rule format with universal quantification
• A general SOS theory for the specification of probabilistic transition systems
• Ensuring liveness properties of distributed systems: open problems
• The meaning of negative premises in transition system specifications. II
• Language preorder as a precongruence
• Title not available (Why is that?)

Uses Software

• Esterel

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Structured operational semantics and bisimulation as a congruence 👍 👎
• The meaning of negative premises in transition system specifications 👍 👎
• Modular Semantics for Transition System Specifications with Negative Premises 👍 👎

This page was built for publication: Transition system specifications with negative premises

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685387)