Transition system specifications with negative premises

DOI10.1016/0304-3975(93)90111-6zbMath0778.68057OpenAlexW2125382028MaRDI QIDQ685387

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

stratification compositionality bisimulation congruence full abstraction modularity labeled transition systems negative conditions ntyft/ntxyft-format structures operational semantics Transition 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)

Related Items

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

Uses Software

Esterel

Cites Work