Transition system specifications with negative premises
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4199656 (Why is no real title available?)
- scientific article; zbMATH DE number 3808928 (Why is no real title available?)
- scientific article; zbMATH DE number 3919813 (Why is no real title available?)
- scientific article; zbMATH DE number 3990852 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 176757 (Why is no real title available?)
- scientific article; zbMATH DE number 1142320 (Why is no real title available?)
- scientific article; zbMATH DE number 4001464 (Why is no real title available?)
- A calculus of communicating systems
- Algebraic laws for nondeterminism and concurrency
- Algèbre de processus et synchronisation
- Bisimulation can't be traced
- Bisimulation through probabilistic testing
- Calculi for synchrony and asynchrony
- Global renaming operators in concrete process algebra
- Higher-level synchronising devices in Meije-SCCS
- Observation equivalence as a testing equivalence
- Structured operational semantics and bisimulation as a congruence
- The Esterel synchronous programming language: Design, semantics, implementation
Cited in
(67)- Back to the format: a survey on SOS for probabilistic processes
- Pushdown Automata and Context-Free Grammars in Bisimulation Semantics
- Reactive bisimulation semantics for a process algebra with timeouts
- scientific article; zbMATH DE number 7559462 (Why is no real title available?)
- Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity
- Compositional equivalences based on open pNets
- Axiomatizing maximal progress and discrete time
- Modal and temporal logics for processes
- SOS rule formats for convex and abstract probabilistic bisimulations
- The meaning of negative premises in transition system specifications. II
- Compositionality of Hennessy-Milner logic by structural operational semantics
- Semantics and expressiveness of ordered SOS
- A general SOS theory for the specification of probabilistic transition systems
- On recursive operations over logic LTS
- Rule formats for determinism and idempotence
- Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
- Structured operational semantics and bisimulation as a congruence
- A unified rule format for bounded nondeterminism in SOS with terms as labels
- Discrete time generative-reactive probabilistic processes with different advancing speeds
- Language preorder as a precongruence
- Bialgebraic foundations for the operational semantics of string diagrams
- Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity
- Tree rules in probabilistic transition system specifications with negative and quantitative premises
- SOS formats and meta-theory: 20 years after
- Divide and congruence. III: Stability \& divergence
- Probabilistic divide \& congruence: branching bisimilarity
- A process algebraic view of Linda coordination primitives
- A precongruence format for should testing preorder
- Barbed bisimulation
- Algebraic theory of probabilistic and nondeterministic processes.
- Comparing three semantics for Linda-like languages
- Ensuring liveness properties of distributed systems: open problems
- A general conservative extension theorem in process algebras with inequalities
- Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity
- Process algebra with four-valued logic
- scientific article; zbMATH DE number 7449995 (Why is no real title available?)
- A pre-congruence format for \(XY\)-simulation
- scientific article; zbMATH DE number 7649945 (Why is no real title available?)
- A conservative look at operational semantics with variable binding
- A process algebraic view of shared dataspace coordination
- Absolute versus relative time in process algebras.
- Ordered SOS process languages for branching and eager bisimulations
- Bochvar-McCarthy logic and process algebra
- On the axiomatisability of priority. III: Priority strikes again
- Rooted branching bisimulation as a congruence
- Branching vs. Linear Time: Semantical Perspective
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
- Rule formats for nominal process calculi
- Notions of bisimulation and congruence formats for SOS with data
- On the expressiveness of Linda coordination primitives.
- Finite axiom systems for testing preorder and De Simone process languages
- Sequent calculi for default and autoepistemic logics
- Process algebra and conditional composition
- Structural operational semantics with first-order logic
- scientific article; zbMATH DE number 1479628 (Why is no real title available?)
- An alternative formulation of operational conservativity with binding terms.
- A comparison of Statecharts step semantics
- Some undecidable properties of SOS specifications
- A format for semantic equivalence comparison
- The theory of interactive generalized semi-Markov processes
- A congruence rule format with universal quantification
- Quantales, finite observations and strong bisimulation
- Variable binding operators in transition system specifications
- A syntactic commutativity format for SOS
- Structural operational semantics for weak bisimulations
- Reduction semantics in Markovian process algebra
- scientific article; zbMATH DE number 176757 (Why is no real title available?)
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)
