SOS formats and meta-theory: 20 years after
From MaRDI portal
Publication:877025
DOI10.1016/J.TCS.2006.12.019zbMATH Open1111.68069OpenAlexW1972475472WikidataQ57745717 ScholiaQ57745717MaRDI QIDQ877025FDOQ877025
Michel A. Reniers, Jan Friso Groote, Mohammadreza Mousavi
Publication date: 19 April 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.12.019
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Formal molecular biology
- Higher-level synchronising devices in Meije-SCCS
- Structured operational semantics and bisimulation as a congruence
- Modular structural operational semantics
- A structural approach to operational semantics
- Notions of bisimulation and congruence formats for SOS with data
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
- Structural operational semantics.
- Process algebra for synchronous communication
- Algebraic laws for nondeterminism and concurrency
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bisimulation can't be traced
- Structural operational semantics for weak bisimulations
- Bisimulation for higher-order process calculi
- Bisimulation through probabilistic testing
- The chemical abstract machine
- A calculus of mobile processes. I
- A calculus of mobile processes. II
- Three Partition Refinement Algorithms
- Testing equivalences for processes
- Proving congruence of bisimulation in functional programming languages
- CCS expressions, finite state processes, and three problems of equivalence
- The algebra of timed processes, ATP: Theory and application
- \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
- Real time process algebra
- Title not available (Why is that?)
- Reactive, generative, and stratified models of probabilistic processes
- Process Algebra
- The \(\pi\)-calculus: A theory of mobile processes
- Compositional SOS and beyond: A coalgebraic view of open systems
- The meaning of negative premises in transition system specifications. II
- Foundations of Software Science and Computational Structures
- Conditional rewriting logic as a unified model of concurrency
- Mapping Modular SOS to Rewriting Logic
- The origins of structural operational semantics
- Process algebra with timing
- Title not available (Why is that?)
- Validation of Stochastic Systems
- Handbook of philosophical logic. Vol. 9
- Title not available (Why is that?)
- Algebraic Methodology and Software Technology
- Two case studies of semantics execution in Maude: CCS and LOTOS
- A theory of higher order communicating systems
- Rooted branching bisimulation as a congruence
- Compositionality of Hennessy-Milner logic by structural operational semantics
- Divide and congruence applied to \(\eta\)-bisimulation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Compositionality Through an Operational Semantics of Contexts
- The meaning of negative premises in transition system specifications
- Title not available (Why is that?)
- Precongruence formats for decorated trace semantics
- On cool congruence formats for weak bisimulations
- CONCUR 2005 – Concurrency Theory
- Transition system specifications with negative premises
- A hierarchy of probabilistic system types
- Turning SOS rules into equations
- Structural operational semantics and bounded nondeterminism
- Rule formats for compositional non-interference properties
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
- Title not available (Why is that?)
- Foundations of Software Science and Computational Structures
- Automata, Languages and Programming
- A syntactic commutativity format for SOS
- Title not available (Why is that?)
- Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS
- Ordered SOS process languages for branching and eager bisimulations
- Axiomatizing GSOS with termination
- From bialgebraic semantics to congruence formats
- Title not available (Why is that?)
- The power of the future perfect in program logics
- A proof theory for generic judgments
- Title not available (Why is that?)
- Title not available (Why is that?)
- A congruence format for name-passing calculi
- Title not available (Why is that?)
- A conservative look at operational semantics with variable binding
- GSOS for probabilistic transition systems (extended abstract)
- Finite axiom systems for testing preorder and De Simone process languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Variable binding operators in transition system specifications
- An alternative formulation of operational conservativity with binding terms.
- A causal semantics for CCS via rewriting logic
- A format for semantic equivalence comparison
- CPO models for compact GSOS languages
- Title not available (Why is that?)
- Prototyping SOS meta-theory in Maude
- On well-foundedness and expressiveness of promoted tyft (being promoted makes a difference)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Foundations of Software Science and Computation Structures
- CONCUR 2003 - Concurrency Theory
Cited In (38)
- Title not available (Why is that?)
- Probabilistic divide \& congruence: branching bisimilarity
- Proving the validity of equations in GSOS languages using rule-matching bisimilarity
- Modelling and analysing neural networks using a hybrid process algebra
- Expressiveness of component-based frameworks: a study of the expressiveness of BIP
- Dynamic structural operational semantics
- A Pre-congruence Format for XY-simulation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Structural operational semantics through context-dependent behaviour
- Back to the format: a survey on SOS for probabilistic processes
- A precongruence format for should testing preorder
- SOS rule formats for zero and unit elements
- The origins of structural operational semantics
- Title not available (Why is that?)
- SOS specifications for uniformly continuous operators
- Coverability Synthesis in Parametric Petri Nets
- Nominal SOS
- Rule formats for determinism and idempotence
- Implicit propagation in structural operational semantics
- Rule formats for distributivity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Compositional bisimulation metric reasoning with Probabilistic Process Calculi
- Title not available (Why is that?)
- Structural operational semantics.
- SOS rule formats for idempotent terms and idempotent unary operators
- Weak Bisimulation as a Congruence in MSOS
- A unified rule format for bounded nondeterminism in SOS with terms as labels
- A Notion of Glue Expressiveness for Component-Based Systems
- On Rule Formats for Zero and Unit Elements
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- A Rule Format for Associativity
Uses Software
This page was built for publication: SOS formats and meta-theory: 20 years after
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877025)
